News for hackers. Stuff that matters.

A comment on Blitsort is an in-place stable adaptive rotate merge sort. Parent comment

Re:Blitsort is an in-place stable adaptive rotate merge sort by nuclearnice3 on Saturday July 10, 2021 @12:31PM (#27794545)
Is the included bench.c the right way to answer that question?

  1m random dist size 128 avg qsort 0.206549 blitsort 0.281630
  10m random dist size 32 avg qsort 2.963479 blitsort 4.394143
  100m random dist size 128 avg qsort 34.996847 blitsort 54.102616
[ Parent | on HN ]
Re:Blitsort is an in-place stable adaptive rotate merge sort by scandum on Saturday July 10, 2021 @04:19PM (#27796154)
It is, those numbers are less favorable than they are on my own machine.

The speed of your RAM memory is likely to have an influence on performance. My system is running at 2133MHz.

[ Parent | on HN ]
Re:Blitsort is an in-place stable adaptive rotate merge sort by nuclearnice3 on Saturday July 10, 2021 @09:08PM (#27797718)
Interesting.

  16 GB 2133 MHz LPDDR3
Built with Apple clang version 12.0.5 (clang-1205.0.22.11) gcc -O3 bench.c
[ Parent | on HN ]