The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
1) The subarray which is already sorted.
2) Remaining subarray which is unsorted.
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.
# Python program for implementation of Selection Sort
def selectionSort(A):
# Traverse through all array elements
for i in range(len(A)):
# Find the minimum element in remaining unsorted array
min_idx = i
for j in range(i+1, len(A)):
if A[min_idx] > A[j]:
min_idx = j
# Swap the found minimum element with the first element
A[i], A[min_idx] = A[min_idx], A[i]
# Driver code to test above
arr = [64, 34, 25, 12, 22, 11, 90]
selectionSort(arr)
print ("Sorted array is:", arr)
Output: Sorted array is: [11, 22, 12, 25, 34, 64, 90]
