When can insertion sort run in n log n time? — Load into a binary search tree. Then inorder traversal.

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