Register

quick sort..plz tell the algo also

6,627 views
3 votes
3 votes
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1?
Assume the pivot is always the first element
A) 1,8,7,6,5,4,3,2,9
B) 1,2,3,6,5,4,7,8,9
C) 1,2,7,6,5,4,3,8,9
D) 1,2,3,5,4,6,7,8,9
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
3 answers
1
radha gogia asked Jul 17, 2015
989 views
why is merge sort better if we try to do sorting on linked lists and also insertion sort and why not any other algo like quick sort or selection sort ?
If we talk about that since since we cant access any random element in a linked list for that reason quick sort cant be used for linked lists ,then in merge sort also we ...
User Avatar
0 votes
0 votes
3 answers
2
radha gogia asked Sep 16, 2015
2,689 views
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap?
To sort n randomly generated numbers. One should prefer which sorting algo ,Quick or Heap?
User Avatar
Link Copied!