We restrict the inputs of our sorting functions to permutations of the numbers $1 \ldots n$. A simple way to visualize the amount of "sortedness" in such a list of numbers is a picture obtained with ListPlot.
(Table Cant Copy)
Write a program that allows you to draw such pictures after each exchange step in the sorting procedures (insertion sort, selection sort, and quicksort). If you wish, you can animate these sequences of pictures to see how the algorithm runs.