+1 vote
in Data Structures & Algorithms II by (110k points)
What is the average case complexity of QuickSort?

(a) O(nlogn)

(b) O(logn)

(c) O(n)

(d) O(n^2)

This question was addressed to me during an interview.

I need to ask this question from Quicksort in division Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Right answer is (a) O(nlogn)

Easy explanation - The position of partition(split) is unknown, hence all(n) possibilities are considered, the average is found by adding all and dividing by 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

...