Entry tags:
A weird sorting algorithm
This actually works:
for i = 1 to n do
for j = 1 to n do
if A[i] < A[j] then
swap A[i] and A[j]
for i = 1 to n do
for j = 1 to n do
if A[i] < A[j] then
swap A[i] and A[j]