In my discrete math textbook, i'm stuck on exercise 25.
25) how many comparisons between values of a[j] and x actually occur when insertion sort is applied to the array of exercise 21?
here is the array from exercise 21 for reference:
a[1] = 7, a[2] = 3, a[3] = 6, a[4] = 9, a[5] = 5