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

(a) O(N^2)

(b) O(N)

(c) O(N log N)

(d) O(log N)

I had been asked this question during an interview.

The above asked question is from Quicksort in division Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct answer is (c) O(N log N)

For explanation: The best case and average case analysis of a quick sort algorithm are mathematically found to be O(N log N).

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.

Categories

...