Selection sort is one of the simplest sorting algorithms. It is similar to the hand picking where we take the smallest element and put it in the first position and the second smallest at the second position and so on. It is also similar. We first check for smallest element in the list and swap it with the first element of the list. Again, we check for the smallest number in a sublist, excluding the first element of the list as it is where it should be (at the first position) and put it in the second position of the list. We continue repeating this process until the list gets sorted.

The time complexity of selection sort is (O(n^{2})).

We follow the following steps to perform selection sort:

- Start from the first element in the list and search for the smallest element in the list.
- Swap the first element with the smallest element of the list.
- Take a sublist (excluding the first element of the list as it is at its place) and search for the smallest number in the sublist (second smallest number of the entire list) and swap it with the first element of the list (second element of the entire list).
- Repeat the steps 2 and 3 with new sublists until the list gets sorted.

### Working of selection sort:

Initial list

First iteration

Second iteration

Third iteration

Fourth iteration

Fifth iteration

Sixth iteration

Final list

Let’s code this in Python

a = [16, 19, 11, 15, 10, 12, 14]
i = 0
while i<len(a):
#smallest element in the sublist
smallest = min(a[i:])
#index of smallest element
index_of_smallest = a.index(smallest)
#swapping
a[i],a[index_of_smallest] = a[index_of_smallest],a[i]
i=i+1
print (a)

The code is just an implementation of the above explanation. We are finding the smallest number by using the ‘min’ function. and then swapping it with the first element of the sublist. You can see this article for the list of the functions available on a Python’s list.