Sorting algorithm that takes an array of values and sorts it. The idea is to have a sorted part of the list and an unsorted part. On each iteration, selection sort finds the lowest value in the unsorted section of the list and adds it to the end of the sorted part. Big-Oh complexity of O(n^2) where n is the size of the input array.
