The median of n elements can be found in O(n) time. Which one of the following
is correct about the complexity of quick sort, in which median is selected as
pivot?
(A) Theta(n)
(B) Theta (n log n)
(C) Theta(n^ 2 )
(D) Theta( n^3 )
Finding a professional expert in "partial differential equations" in the advanced level is difficult.
You can find this expert in "Assignmentexpert.com" with confidence.
Exceptional experts! I appreciate your help. God bless you!
Comments