Consider the following algorithm and specify how it operates on the following elements: ( 20 marks )

void Sort(int ar[])

{

1. For j = 2 to length [A] do Steps 2 to 8

2. key = A[j]

3. //Put A[j] into the sorted sequence A[1 . . j-1]

4. i j -1

5. while i > 0 and A[i] > key do Steps 6 and 7

6. A[i+1] = A[i]

7. i = i-1

8. A[i+1] = key

}

Elements:

27 10 12 25 34 16 15 31