Hacker News new | ask | show | jobs
by deletes 4571 days ago
Took a quick look at their insertion sort algorithm. It looks wrong, doing unnecessary swaps, when moving elements up. For and extra O(1) memory your can avoid that.