// Input: An array A[0..n-1] of n orderable elements

for i 1 to n 1 do

j i 1;

while j 0 and A[j] > A[j+1] do

swap(A[j], A[j+1];

j

// Input: An array A[0..n-1] of n orderable elements

for i =1 to n 1 o

j = i 1;

while j >=0 and A[j] > A[j+1] do

swap(A[j], A[j+1];

j = j 1;

[c] What is the basic operation in the algorithm?

[d] How many times is the basic operation executed?

[e] What is the time efficiency class for this algorithm?