Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:                 SelectionSort(A) 1 for i = 0 to A.length-1 2     mini = i 3     for j = i to A.length-1 4         if A[j] < A[mini] 5             mini = j 6     swap A[i] and A[mini]   Note that, indices for array elements are based on 0-origin.  Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
    v = a[i]
    j = a[i:].index(min(a[i:]))+i
    w = a[j]
    v, w = w, v
    if i != j:
        ans+=1


print(a)
print(ans)
        

def ssort(a,n):
    count = 0
    for i in range(n):
        mini = i
        for j in range(i, n):
            if a[mini]>a[j]:
                mini = j
        if i!=mini:
            a[i], a[mini] = a[mini], a[i]
            count+=1
    print(*a)
    print(count)
n= int(input())
a = [int(x) for x in input().split()]
ssort(a,n)

