Question: What is the recurrence relation for quick sort? Question 2 options: T ( n ) = n + T ( n / 2 ) T

What is the recurrence relation for quick sort?
Question 2 options:
T(n)= n+ T(n/2)
T(n)= n + T(n-1)
T(n)= n+T(n/3)
Not enough information

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!