```python
def selection_sort(L):
    len_list = len(L)
    for i in range(len_list):
        min_index = i
        for j in range(i+1, len_list):
            if L[min_index] > L[j]:
                min_index = j
        L[i], L[min_index] = L[min_index], L[i]
```

Google

This algorithm sorts an array by repeatedly finding the minimum element from the unsorted part and putting it at the beginning. There are two parts to this algorithm (and thus two loops): 
1. The subarray that is already sorted
2. The remaining subarray that is unsorted. 

For instance, if we had an array ```arr[] = 64 25 12 22 11```

The algorithm will sort the array in the following steps:
```
11 25 12 22 64

11 12 25 22 64

11 12 22 25 64

11 12 22 25 64
```

Learn Before

Related