Intro Sort (Comparison Sorting Sorting)

From Algorithm Wiki

Revision as of 09:29, 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 \log n)$

Space Complexity

$O(logn)$ words

((see quicksort + heapsort))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1997

Reference

https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-024X%28199708%2927%3A8%3C983%3A%3AAID-SPE117%3E3.0.CO%3B2-%23

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Intro_Sort_(Comparison_Sorting_Sorting)&oldid=47279"