Re:Unconventional Sorting Algorithms
by unnouinceput on Thursday October 21, 2021 @06:25PM
(#28951565)
fastest swap implementation, assembler:
PUSH A[j]; PUSH A[i]; POP A[j]; POP A[i];
PUSH A[j]; PUSH A[i]; POP A[j]; POP A[i];
for j = 1 to n do
if A[i] < A[j] then
swap A[i] and A[j