←back to thread

Google's “Director of Engineering” Hiring Test

(www.gwan.com)
1764 points fatihky | 1 comments | 13 Oct 16 15:15 UTC | HN request time: 0.204s | source
Show context
sonoffett ◴[13 Oct 16 15:58 UTC] No.12701639[source]▶
quicksort is O(n^2) which is definitely not the "best big-O" for sorting.
replies(4): >>12701670 #>>12701718 #>>12701729 #>>12701867 #
1. pkaye ◴[13 Oct 16 16:22 UTC] No.12701867[source]▶
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.