Quick Sort (Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 08:32, 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(n^{2})$

Space Complexity

$O(\log n)$ words

(https://academic-oup-com.ezproxy.canberra.edu.au/comjnl/article/5/1/10/395338?login=true)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1961

Reference

https://apps.dtic.mil/dtic/tr/fulltext/u2/740110.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Quick_Sort_(Comparison_Sorting_Sorting)&oldid=47304"