Question

For a list of length n, insertion sort makes _key comparisons, in the worst case. None of these O(nlogzn) On O) O() Question 20 The time complexity of the quick sort is in the worst case and in the average case O), O) O(nlogon), O(nlogon) (12), O(nlog.) O(nlogon). 0() O(P), (n)

Answer 1

                       ANSWER : HERE IS THE ANSWER FOR YOUR QUESTION:

  

                       ------------------------------------------------------------------------------------------------------

Question 1) insertion sort is the algorithm in which the comparision is done between the element of the list and the the element are keep on inserted at thier correct order in sorted form

in worst case , that is when the list is reversely sorted , the algorithm would make o(N ^2) comparisions

thus , the correct option is  

4) O(n^2)

Question 2) worst case of the quick-sort algorithm is when we select the left-most element of the list as pivot and also any of the below condition is true:

1) list is already sorted

2) list is reversely sorted

thus , the worst case complexity is o(n^2) and average case is o(n log n)

thus , the correct option is

c) o(n^2) and o(n log(n))

-------------------------------------------------------------------------------------------------------

I hope this would help you out.

If you like my answer , please upvote

If you have any doubt, you can provide comment /feedback below the answer

Thanks