Which are the deterministic sorting algorithms with O(nlogn)...? Only name few algorithms...
Asked
Active
Viewed 752 times
-2
apkos99
- 109
- 7
1 Answers
2
Merge sort and heap sort are the archetypal O(nlogn) examples and are deterministic. Quicksort is O(nlogn) in the average case but not usually in the worst case (which is O(n^2)). Quicksort is very often implemented with a randomized pivot, so it's not always deterministic.
Martin Dinov
- 8,757
- 3
- 29
- 41