What is the running time of quicksort when all elements of array a have the same value?
Answers
Answered by
31
Answer:
The running time of QUICKSORT when all elements of array A have the same value will be equivalent to the worst case running of QUICKSORT since no matter what pivot is picked, QUICKSORT will have to go through all the values in A. And since all values are the same, each recursive call will lead to unbalanced partitioning.
Step-by-step explanation:
Similar questions