Today I read a new chapter from DIETEL C++ How To Program on Pointers and Pointer-Based String. This chapter has been great on helping me understand how pointers work and why they are efficient. One of the algorithms the book discussed was the Selection Sort Algorithm. This was a simple algorithm but explains that it is inefficient on large lists and can even be slower on it’s similar algorithm the insertion sort. The way this algorithm works is that it iterates through the array selecting the smallest element in the array and swapping it with the first element. This process continues until it reaches the second to last element in the array. I have provided an example of the sort in C++ which you can view from the link below.