If the following sequence (2,2) (0,4) (1,4) (0,1) (1,2) (0,6) (2,1) (1,1) is sorted using a stable sort by ascending order on the first key (left number) and then using the same method on the second key (right number), the result would be:

Sort the following in order of asymptotic order: fa(n) = n" f2(n) = nvn f3(n) = 2" fa(n) = f4(n/2) + n

In quick sort, if the input array is already sorted, which of the following algorithm will still perform at-least one swap.     a Lomuto's algorithm   b Both Lomuto's and Hoare's algorithms   c none of Hoare's or Lomuto's algorithm   d Hoare's Algorithm