Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
usmansk
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
usmansk
3y ago
Can anyone refute the claim of orlp that it is unrolled insertion sort
2.
▲
by
usmansk
3y ago
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.