Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison- based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list.

The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.

This algorithm is not suitable for large data sets as its average and worst case complexities are of

**Ο (n****2****), **where **n **is the number of items.

##### How Selection Sort Works?

** **Following are the steps involved in selection sort (for sorting a given array in ascending order):

- Starting from the first element, we search the smallest element in the array, and replace it with the element in the first position.
- We then move on to the second position, and look for smallest element present in the subarray, starting from index 1, till the last index.
- We replace the element at the
**second**position in the original array, or we can say at the first position in the subarray, with the second smallest element. - This is repeated, until the array is completely sorted.

Let's consider an array with values **{14, 33, 27, 10, 35, 19, 24, 44}**

For the first position in the sorted list, the whole list is scanned sequentially. The first position where **14 **is stored presently, we search the whole list and find that **10 **is the lowest value.

So we replace **14 **with **10**. After one iteration **10**, which happens to be the minimum value in the list, appears in the first position of the sorted list.

For the second position, where **33 **is residing, we start scanning the rest of the list in a linear manner.

We find that **14 **is the second lowest value in the list and it should appear at the second place. We swap these values.

After two iterations, two least values are positioned at the beginning in a sorted manner.

The same process is applied to the rest of the items in the array. Following is a pictorial depiction of the entire sorting process

Now, let us learn some programming aspects of selection sort.