The selection sort algorithm is to identify the smallest element in an array and sort it accordingly. The selection sort algorithm is an in-place comparison-based method that divides the input array into two sections: a sorted array on the left and an unsorted array on the right. Let us have a rough sketch of selection sorting:
1. Assign the minimum value to array index 0
2. Search Smallest element input in an array
3. Swap with value at the location of minimum value
4. Increment minimum value to point next element
5. Repeat until the array is sorted.