GBICS

Algorithm 1 ICan’tBelieveItCanSort(A[1..n])

# https://arxiv.org/pdf/2110.01111.pdf


In [42]: def sort_simple(l):
    ...:     a = l
    ...:     for i in range(len(a)):
    ...:         for j in range(len(a)):
    ...:             if a[i] < a[j]:
    ...:                 tmp = a[i]
    ...:                 a[i] = a[j]
    ...:                 a[j] = tmp
    ...:     return a
    ...:

In [43]: ints = [int(random.random() * 1000) for x in range(10)]

In [44]: ints
Out[44]: [499, 306, 429, 276, 879, 858, 321, 316, 778, 295]

In [45]: sort_simple(ints)
Out[45]: [276, 295, 306, 316, 321, 429, 499, 778, 858, 879]