Select the correct answerWhat is the worst case time complexity of a quick sort algorithm?OptionsO(N)O(N^2)O(log N)O(N log N)

What is the worst case time complexity of a quick sort algorithm? a. O(N2) b. O(N) c. O(log N) d. O(N log N)

Select the correct answerWhat is the average running time of a quick sort algorithm?OptionsO(N^2)O(N log N)O(log N)O(N)

What is the time complexity of the quicksort algorithm in the worst case?

The time complexity of quicksort is ……..a.O(n)b.O(logn)c.O(n2)d.O(n logn)

For which of the following algorithms is O(n^2) the best-case time complexity?Quick sortMerge sortInsertion sortBubble sort