Construct a trace table showing the action of insertion sort on the array of exercise 20.

Construct a trace table showing the action of insertion sort on the array of exercise 20.

Given information:

Concept used:

Insertion sort algorithm is used.

Calculation:

The algorithm of insertion sort is

For

k=2 to nx=a[k]J=k−1

while(J≠0)

if x<a[j]

a[J+1]=a[J]J=J−1

End if

End while

a[J+1]=x

Next k

In insertion sort algorithm when fort next loop is first inserted k is assigned the value 2

x is assigned the value of a(2) which is 2 and J have the value k−1 which is v. since J≠1 the while loop is entered and the condition for the if-then else statement is tested. Inside the if-then else statement the value of x is compared with a[1]