Register

quick sort

2,293 views
2 votes
2 votes
If we use quicksort algorithm to sort the elements: $16, 13, 14, 12, 21, 16, 23$ and $15$ in ascending order, what is the output after the first pass of quicksort? (Assume pivot element is beginning of an array)
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.6k
views
1 answers
3 votes
iarnav asked Jan 14, 2018
2,562 views
quick sort
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 best case performance isa) O(n2)b) O(nlogn)c) Θ(nlogn)d) O(n3)
User Avatar
1.7k
views
3 answers
3 votes
Sourajit25 asked Sep 3, 2017
1,740 views
Quick Sort
"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 good article.
User Avatar
1.4k
views
1 answers
3 votes
SHALINI PORWAL asked Aug 10, 2017
1,425 views
Quick sort
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?
User Avatar
1.3k
views
3 answers
2 votes
LavTheRawkstar asked Apr 15, 2017
1,331 views
With quick sort The results after first partioning of the given array
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.
User Avatar
Link Copied!