Hacker News Reader

Combsort is far more elegant and faster algorithm. I've wrote a type-generic combsort a while ago here: https://github.com/FrozenVoid/combsort.h

(Combsort as well as mentioned algorithm also consists of two loops and a swap)

View on HN

I don't think that the goal here is to show a fast and elegant sort, but rather to show that a sorting algorithm that seems like it can't possibly work actually does. That is, probably no-one will learn from this article how to sort better, but hopefully people will learn from this article how to formally prove things (e.g., about sorting) better.

Yes (co-author here) that was exactly the point. Thanks for putting it clearly.

Reply on news.ycombinator.com