the art of
Algorithm
Notes on Analysis and Design



Selection Sort
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def selectionsort(arr):
    
    for i in range(len(arr)):
        min_index=0
        for j in range(i+1,len(arr)):
            if arr[j]<arr[min_idx]:
                min_idx=j
        arr[i],arr[min_index]=arr[min_index],arr[i]


arr=[6,3,9,1]
selectionsort(arr)
for i in range(len(arr)):
    print arr[i],


#function 2 for Selection Sort
for i in range(len(arr)):
    min_item=min(arr[i:])
    arr[i],arr[arr.index(min_item)]=arr[arr.index(min_item)],arr[i]
    print min_item