Sorting with BSTs
Since run time is proportional to the number of comparisons, same time as quicksort: O(n lg n)
Which do you think is better, quicksort or BSTSort? Why?
A: quicksort
- Better constants
- Sorts in place
- Doesn’t need to build data structure