Naive Selection (kth Order Statistic kth Order Statistic)

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O({1})$ (can use in-situ sorting) words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")

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

Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O({1})$ (can use in-situ sorting) words

(can be easily derived)

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_Selection_(kth_Order_Statistic_kth_Order_Statistic)&oldid=44384"