Sorting based (Merge Sort) (Duplicate Elimination Duplicate Elimination)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(Derived: linear space for mergesort)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1964

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Sorting_based_(Merge_Sort)_(Duplicate_Elimination_Duplicate_Elimination)&oldid=48031"