1 Answer

1 votes
1 votes

first choosing 60 as pivot element and applying first pass of Quick Sort we get 

55 15 7 12 35 60 80 90 95.

Now left side of 60 can be arrange in 5! and right side can be arrange in 3! ways.

Total ways=5!*3!=720

Related questions

3 votes
3 votes
2 answers
1
dhruba asked Jun 5, 2023
1,045 views
In QuickSort algorithm, which of the following statements is NOT true regarding the partition process?a) Partition always divides the array into two non-empty subsets.b) ...
1 votes
1 votes
1 answer
3
Saurabh Sharma asked Jul 22, 2015
1,073 views
THISCOURSEISOVERChoose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop.a) EHIOCOIERRUSSVTSb) EHISCOIERRUSOVTSb)...
2 votes
2 votes
3 answers
4
LavTheRawkstar asked Apr 15, 2017
1,245 views
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.