News for hackers. Stuff that matters.

usmansk

Can anyone refute the claim of orlp that it is unrolled insertion sort
The claim "faster sorting algorithm" is wrong. They have to show the time-complexity. They have to prove that their algorithm is faster than linear sorting algorithms. Otherwise, they have to accept that their claim is wrong.