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

i think the answer is b.

step-by-step explanation:

not 100% sure though.

javeir earned 56 dollors more than kyle so kyle and javier had 14w but javier made 56 dollors more so 14w plus 56 equals 70w so kyle has 14w

step-by-step explanation: hope i plz give me brainliest with the points so this is not constant cause it says last week so its clearly not every week