discussion of #sorting #algorithms #performance and cmov
#biography and obituary of Andrey Astrelin, who discovered the GrailSort #sorting algorithm before dying of glioblastoma multiforme at 47 in 02017. #algorithms
on 02024-06-10#video on #sorting #algorithms with colors #formina
on 02024-06-10#video of 80 #sorting #algorithms with music, including lots I hadn’t heard of: Andreysort (Grailsort), bitonic sort, odd-even sort, circle sort, cycle sort, weak heap sort, etc. It’s always sorting the numbers 0 to N (either N=8, N=16, N=32, N=64, N=128, N=1024, or N=2048) and emits two tones whose frequencies are determined by the two numbers being considered.
on 02024-05-26#sorting 16 items by comparisons takes at least 55 comparisons and at least 9 stages of comparisons (which requires 60 comparisons)
on 02023-09-25#performance of #quicksort on current hardware improves with, among other things, branchless bubble #sorting #algorithms instead of insertion sort, which is damned surprising
on 02023-09-25Malte Skarupke describes his ska_sort, a radix #sorting algorithm that beats the comparison-based implementation in (some implementation of) the STL on modern hardware by a factor of two to seven, largely due to better instruction-level parallelism. Typically it starts to win at about 64 items. #algorithms
on 02017-01-03