Register

Give the result of partitioning the keys after the 1st pass of quicksort.

1,069 views
1 votes
1 votes
THISCOURSEISOVER
Choose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop.

a) EHIOCOIERRUSSVTS

b) EHISCOIERRUSOVTS

b) EHIOCOUESRTSSVTR

c) EHIOOCIERRUSSVTS
User Avatar

1 Answer

0 votes
0 votes

the answer is hicoeioerssuvrs prany datta is right.    and saurabh sharma the question may be wrong or it must be incomplete because they may ave used some other implementation of quick sort.

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

Related questions

2 votes
2 votes
1 answer
1
gate_forum asked Dec 18, 2015
740 views
probability of a split in partitioning procedure of quicksort
probability of a split more balanced than a to (1-a) split in partitioning procedure of quicksort where 0<a<=1/2? 1-3a 1-2a a+1 none
probability of a split more balanced than a to (1-a) split in partitioning procedure of quicksort where 0<a<=1/2?1-3a 1-2a a+1 none
User Avatar
2 votes
2 votes
3 answers
2
LavTheRawkstar asked Apr 15, 2017
1,226 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.
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
0 votes
0 votes
0 answers
3
Gurdeep Saini asked Nov 13, 2018
295 views
chache performance between hoare and loranto quicksort
between hoare and loranto quicksort which give better cache performance ? we know that in hoare quicksort we move the pointer i,j in different direction but in loranto quicksort we move i,j in same direction so the cache performance of loranto should be better?
between hoare and loranto quicksort which give better cache performance ?we know that in hoare quicksort we move the pointer i,j in different direction but in loranto qui...
User Avatar
0 votes
0 votes
1 answer
4
Vaishnavi01 asked Sep 21, 2018
672 views
Randomized Quicksort
True or False : In randomized quicksort , each key is involved in the same number of comparisons.
True or False :In randomized quicksort , each key is involved in the same number of comparisons.
User Avatar
Link Copied!