Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Jiig
on Oct 13, 2016
|
parent
|
context
|
favorite
| on:
Google's “Director of Engineering” Hiring Test
Its worst case is O(n^2) sure, so heap sort would be better if you know that your data would hit the worst case scenario of quick sort every time.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
