Question

With quick sort The results after first partioning of the given array.

A = (2,8,7,1,3,5,6,4,9).

Analysis the time complexity of Quick sort in the best case.

Comments

Possible duplicate of https://gateoverflow.in/125608/a-list-of-elements-are-given-a-3-1-4-1-5-9-2-6-5-3-5-8-9#a125613

Answer 1

After the first pass,I think we would get the same array because 9 is the pivot element and all the no.s before it are smaller than it.So there wouldn't be any change.

Comments

respected mam i am also having confusion mam please post your entire solution please

---

Plz don't call me ma'am.And for this I referred to the algorithm of quick sort given in Cormen.You once see that and try this.Here pivot is always chosen as the last element so 9 will be the pivot and then all the elements before it are checked.If they are smaller then no change and all the elements here are smaller than 9.So there should not be any change in the array.According to me.

Answer 2

you can select 2 as pivot element

Answer 3

If we take 9 as the pivot element the array remains same bcoz no one is greater than 9