Tim Sort (Comparison Sorting Sorting)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n logn)$

Space Complexity

$O(n)$ words

((can be easily derived))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

-