Quicksort is O(n log n) average and O(n^2) worst case. Heapsort is O(n log n) fo...

		pkaye on Oct 13, 2016 \| parent \| context \| favorite \| on: Google's “Director of Engineering” Hiring Test 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.