Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

But why didn't you use the O(n) solution instead of the O(n log n) solution?


To be honest, I had forgotten the O(n) solution and vaguely remembered the nlogn solution. After that experience, I have both solutions lodged in my brain.


I suppose if you had to optimize for least space used sorting in place and doing it they way they suggested would be best.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: