Conditional-move sorting networks sort 2 to 16 items up to 59% faster than insertion sort on random data, but the gain shrinks to 2-9% when embedded in quicksort or IPS4o because of instruction-cache pressure.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Engineering Faster Sorters for Small Sets of Items
Conditional-move sorting networks sort 2 to 16 items up to 59% faster than insertion sort on random data, but the gain shrinks to 2-9% when embedded in quicksort or IPS4o because of instruction-cache pressure.