[^1]
def insertion_sort_nonincresing(A):
for i in range(1, len(A)):
key = A[i]
j = i - 1
while j >= 0 and A[j] < key:
A[j + 1], A[j] = A[j], key
j -= 1
return A
print(insertion_sort_nonincresing([5, 2, 3, 4]))
lala
test
we have \(x_1 = 132\)
and \(x_2 = 370\)
and so .
And test a display math without equaltion number: