Re: Help with homework
4) [Comparing worst times only]
Heapsort takes: done in O(n Log n)
(assuming two elements of S can be compared in O(1) time)
quicksort: Quicksort is a space-optimized version of the binary tree sort. = O(n log n)
binary search: O(n)
linear search:
hashing: O(n) [usually much better]