Hacker News new | past | comments | ask | show | jobs | submit login

This is an interesting motivation, but the algorithm itself isn't particularly novel -- it's more or less a Quick sort with a really bad way of selecting pivots.



Yes and no...it does use a pivot, true, but is a bit more distinct than just that. For one thing, it is iterative where quicksort is recursive, so it doesn't need any external storage for a stack.


hence the name.




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

Search: