How can you speed up selection sort with a heap? — Replace the unsorted portion with a min-heap. Gives O(log n) removal. Makes n log n overall.

This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university