+1 vote
in Data Structures & Algorithms II by (110k points)
What is the worst case time complexity of a quick sort algorithm?

(a) O(N)

(b) O(N log N)

(c) O(N^2)

(d) O(log N)

I have been asked this question during an interview for a job.

Origin of the question is Quicksort topic in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
The correct option is (c) O(N^2)

The best explanation: The worst case performance of a quick sort algorithm is mathematically found to be O(N^2).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.