Naive algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix)

From Algorithm Wiki

Revision as of 09:40, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O({1})$ words

(Only needs to keep track of current minimum in current row - once done with a row, can send stored minimum to output and recycle space)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Naive_algorithm_(_Minimum_value_in_each_row_of_an_implicitly-defined_totally_monotone_matrix)&oldid=47368"