Page 1122 - AP Computer Science A, 7th edition
P. 1122
17. (B) An insertion sort compares a[1] and a[0]. If they are not in the correct order, a[0] is moved and a[1] is inserted in its correct position. a[2] is then inserted in its correct position, and a[0] and a[1] are moved if necessary, and so on. Since B has only one element out of order, it will require the fewest c hanges .
