3 ms·
Quicksort is O(n log n) average and O(n^2) worst case. Heapsort is O(n log n) for both average and worst case.
by pkaye 10y ago
Quicksort is O(n log n) average and O(n^2) worst case. Heapsort is O(n log n) for both average and worst case.
loading thread…