in Algorithms
227 views
0 votes
0 votes
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst case?
in Algorithms
227 views

4 Comments

How can you divide the array into two equal parts since the pivot itself is same as the rest of the elements
0
0
It is given in the question.
0
0
Or you can just pick the midpoint every time. Given that all elements are the same.
0
0

Please log in or register to answer this question.