Question: a.Suppose you are using a Quicksort algorithm that always selects the first value in the list as pivot. Give an example input sequence that takes
a.Suppose you are using a Quicksort algorithm that always selects the first value in the list as pivot. Give an example input sequence that takes theta(n^2) time to complete
question B: Suppose quicksort could always pivot on the median of the current sublist. what would Quicksort's performance be in the worst case?( expressed in terms of theta)?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
