If you can also give an implementation of this in c++ code, it would be much appreciated

2. Consider the the following list of numbers: What happens to the number of comparisons for each of the sort algorithms if the list is already sorted