c++
For this problem, you will need to sort a list of whitespace separated integers using three different sort algorithms (described here: http://theoryapp.com/selection-insertion-and-bubble-sort/ and https://en.wikipedia.org/wiki/Insertion_sort).
Your program will output the state of the initial list of numbers and also after each swap for each of the three sorting algorithms (selection, insertion, and bubble). Note: You want to use the version of insertion sort from Wikipedia.
Do not perform swaps if they don't change the vector.
Inputs:
8
8 4
1 7 5 9 3 2
1 6 3 8 4 2 9 4 2 5