def find_min_index(A, start):
    min_idx = start
    for i in range(start+1, len(A)):
        if A[i] < A[min_idx]:
            min_idx = i
    return min_idx

def selection_sort(A):
    N = len(A)
    for i in range(N - 1):
        min_idx = find_min_index(A, i)
        A[i], A[min_idx] = A[min_idx], A[i]

A = [6, 3, 2, 5, 7, 1, 4]
selection_sort(A)
print(A)
