What is the answer of this problem?(This is for java code)

Question

When rearranged in ascending order using the insertion sorting algorithm,

which one among the arrays listed below will need the fewest changes of positions

for the elements?

a. { 3, 5, 4, 1, 2}

b. { 5, 1, 2, 3, 4}

c. { 4, 3, 2, 1, 5}

d. { 4, 5, 1, 2, 3}

e. { 1, 5, 4, 3, 2}

Answer 1

Array A:

pass 1: nothing changes

pass 2: 3 4 5 1 2 ---> 1 change

pass 3: 1 3 4 5 2 ---> 3 changes

pass 4: 1 2 3 4 5 ---> 3 changes

TOTAL: 7 changes

Array B:

pass 1: 1 5 2 3 4 ---> 1 change

pass 2: 1 2 5 3 4 ---> 1 change

pass 3: 1 2 3 5 4 ----> 1 change

pass 4: 1 3 3 4 5 ----> 1 change

TOTAL : 4 changes

Array C:

pass 1: 3 4 2 1 5 ---> 1 change

pass 2: 2 3 4 1 5 ---> 2 changes

pass 3: 1 2 3 4 5 ---> 3 changes

TOTAL : 6 changes

Array D:

pass 1: nothing changes

pass 2: 1 4 5 2 3 ---> 2 changes

pass 3: 1 2 4 5 3 ---> 2 changes

pass 4: 1 2 3 4 5 ---> 3 changes

TOTAL: 6 changes

Array E:

pass 1: nothing changes

pass 2: 1 4 5 3 2 --> 1 change

pass 3: 1 3 4 5 2 --> 2 changes

pass 4: 1 2 3 4 5 ---> 3 changes

TOTAL: 6 changes

Notice that Array B is almost sorted. That is why insertion sort is SO FAST when the array is almost sorted