News for hackers. Stuff that matters.
Re:Unconventional Sorting Algorithms by DeathArrow on Thursday October 21, 2021 @03:49PM (#28949970)
for i = 1 to n do

for j = 1 to n do

if A[i] < A[j] then

swap A[i] and A[j

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];