What does the algorithm given below do? - Analyze the algorithm in detail.

What is the basic process?

How many times is the basic operation repeated?

What is the efficiency class?

What is the best, worst, average case for the algorithm?

for j = 2 to A.length do

key = A[j]

i = j-1

while i >0 and A[i]> key do

A[i+1]=A[i]

i = i-1

end while

A[i+1] = key

end for