今天看到一个新发现的有趣的排序算法。

新算法：
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 = i + 1 to n do
if A[i] > A[j] then
swap A[i] and A[j]

算法来源： https://arxiv.org/pdf/2110.01111.pdf