TachyonSort is the efficient unstable sorting algorithm that has low-footprint implementation (efficient memory usage and small code size), no division/modulus/multiplication operators and ultra-fast speed.
TachyonSort was created by William Stafford Parsons as a product of Eightomic.
TachyonSort is licensed with BSD-3-Clause.
Each mention of TachyonSort refers to each of the 3 following variants individually (tachyonsort_small, tachyonsort_medium and tachyonsort_large) implemented in C.
The tachyonsort_small function sorts (in unstable ascending order) an elements array of elements_length elements.
The integral type of each element in elements must match the integral type of element.
tachyonsort_medium and tachyonsort_large aren't ready to publish yet.