3 ms·
for i = 1 to n do for j = 1 to n do if A[i] < A[j] then swap A[i] and A[j
by DeathArrow 5y ago
for i = 1 to n do
for j = 1 to n do
if A[i] < A[j] then
swap A[i] and A[j
- unnouinceput 5y agofastest swap implementation, assembler: PUSH A[j]; PUSH A[i]; POP A[j]; POP A[i];