Квадратичные сортировки

def SelectionSort(A):
    for i in range(0, len(A) - 1):
        min_idx = i
        for j in range(i + 1, len(A)):
            if A[j] < A[min_idx]:
                min_idx = j
        A[i], A[min_idx] = A[min_idx], A[i]

def InsertionSort(A):
    for i in range(1, len(A)):
        new_elem = A[i]
        j = i - 1
        while j >= 0 and A[j] > new_elem:
            A[j + 1] = A[j]
            j -= 1
        A[j + 1] = new_elem

def BubbleSort(A):
    for j in range(len(A) - 1, 0, -1):
        for i in range(0, j):
            if A[i] > A[i + 1]:
                A[i], A[i + 1] = A[i + 1], A[i]