Overview This sort is pretty easy to understand. At a very high level it simply takes your unsorted data and splits it into two chunks, unsorted and sorted. One by one it moves the data from the unsorted chunk to the sorted chunk in the correct order. This leaves you with a sorted data set in the end. For example, if you have the following unsorted data: [10,13,4,8,232,1,2,382,81,1] Think of it as two logical chunks. The sorted chunk has no data in it, the unsorted chunk has 10 pieces of data. So how do you move the unsorted data into the sorted data chunk? I’m sorting this in ascending order for the example, but other orders can be used if they make sense. Basically the sort works by looking through every item in the data set and then placing the (in this case) smallest item and swapping it with the […]