![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
A weird sorting algorithm
Oct. 11th, 2021 11:40 amThis 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]
