1,192 views
2 votes
2 votes
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.

3 Answers

Best answer
2 votes
2 votes
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.
selected by
0 votes
0 votes
If we take 9 as the pivot element the array remains same bcoz no one is greater than 9

Related questions

3 votes
3 votes
1 answer
1
iarnav asked Jan 14, 2018
2,464 views
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the...
3 votes
3 votes
3 answers
2
Sourajit25 asked Sep 3, 2017
1,616 views
"Quick sort has good cache performance" , Can anyone explain this statement.How is cache related to quick sort.I searched for this over the internet but could not find a ...
3 votes
3 votes
1 answer
3
SHALINI PORWAL asked Aug 10, 2017
1,358 views
When array is already sorted in reverse order then what will be the recurrence relation for number of swaps on array of n elements using quick sort?