retagged by
1,067 views
0 votes
0 votes

retagged by

2 Answers

Related questions

3 votes
3 votes
1 answer
2
iarnav asked Jan 14, 2018
2,461 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
3
Sourajit25 asked Sep 3, 2017
1,615 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
4
SHALINI PORWAL asked Aug 10, 2017
1,357 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?