A weird sorting algorithm

[dmm]

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]

Comments

[dmm]

https://arxiv.org/abs/2110.01111

"Is this the simplest (and most surprising) sorting algorithm ever?", by Stanley Fung (U. of Leicester)

[dmm]

Via https://twitter.com/k_saifullaah/status/1445746638702534663

and https://twitter.com/PetarV_93/status/1445743289727008771

[vak]

Переизобрели пузырьковую сортировку?

[juan_gandhi]

На Архиве статья запощена. Не стал смотреть доказательств. Красивое.