Is this the simplest (and most surprising) sorting algorithm ever?

ICantBelieveItCanSort.cs

// https://news.ycombinator.com/item?id=28758106
// https://arxiv.org/abs/2110.01111

using System;
					
public class Program
{
	public static void Main()
	{
		var n = new []{3,2,4,1};
		Sort(n);
		n.Dump();
	}
	
	private static void Sort(int[] A)
	{
		for (var i = 0; i < A.Length; i++)
    		for (var j = 0; j < A.Length; j++)
      			if (A[i] < A[j])
					(A[i], A[j]) = (A[j], A[i]);
	}
}