Thorup's Sorting Algorithm (Comparison Sorting Sorting)

From Algorithm Wiki

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

Space Complexity

$O(n)$ words

(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0196677402912113)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0196677402912113

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Thorup%27s_Sorting_Algorithm_(Comparison_Sorting_Sorting)&oldid=47310"