Assume that each pair is in reverse order (so that the second smallest element comes before the smallest, the fourth smallest element comes before the third smallest, etc.). For example,

60, 50, 40, 30, 100, 90, 20, 10, 80, 70
What is the exact number of comparisons in the best case as a function of n?

Problem 2. Assume that each pair is in order (so that the smallest element comes before the second smallest, the third smallest element comes before the fourth smallest, etc.). For example,

50, 60, 30, 40, 90, 100, 10, 20, 70, 80
What is the exact number of comparisons in the worst case as a function of n?