Question: Find the average case complexity of the Mystery-sort algorithm for sorting 3 distinct elements (n=3) for each of the following operations: # of assignments of

Find the average case complexity of the Mystery-sort algorithm for sorting 3 distinct elements (n=3) for each of the following operations: # of assignments of keys and # of comparisons. Mystery-sort (A, n) //Sorts the Array A(1:n) in non-decreasing order. for j = 2 to n do // A(1:j-1) is already sorted val + A(j),i+j-1 while (i > 1) and (A(i) > val) do A(i+1) A(i), ii-1 endwhile A(i + 1) + val endfor
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
