selectionSort.py

# program for selection sort
#selections sort takes O(n^2) time complexity



#program starts from here
defselectionSort( itemsList ):
n=len( itemsList )
foriinrange( n-1 ): 
minValueIndex=i

forjinrange( i+1, n ):
ifitemsList[j] <itemsList[minValueIndex] :
minValueIndex=j

ifminValueIndex!=i :
temp=itemsList[i]
itemsList[i] =itemsList[minValueIndex]
itemsList[minValueIndex] =temp

returnitemsList

# Selection sort in Python

# time complexity O(n^2)

#sorting by finding min_index
#CODE = 
defselectionSort(array, size):

forindinrange(size):
min_index=ind

forjinrange(ind+1, size):
# select the minimum element in every iteration
ifarray[j] <array[min_index]:
min_index=j
# swapping the elements to sort the array
 (array[ind], array[min_index]) = (array[min_index], array[ind])

arr= [-2, 45, 0, 11, -9,88,-97,-202,747]
size=len(arr)
selectionSort(arr, size)
print('The array after sorting in Ascending Order by selection sort is:')
print(arr)