9.3-3 Show how quicksort can be made to run in Or ig n) time in the worst case, as suming that all elements are distinct. Show transcribed image text 9.3-3 Show how quicksort can be made to run in Or ig n) time in the worst case, as suming that all elements are distinct.
Answer
Rursive formula for quick sort isT(n) = 2T(n/2) + nT(n) = 2T(n/2) + n
OR
OR