Register

Recent questions tagged quick-sort

1 votes
1 answer
91
Quicksort
Consider an array with following element 12, 18, 17,11, 13, 15, 16 ,14 The number of element will change their initial position after completion of partition algorithm by choosing 15 as a pivot are __ Please solve step by step.
Consider an array with following element12, 18, 17,11, 13, 15, 16 ,14The number of element will change their initial position after completion of partition algorithm by c...
User Avatar
1 votes
1 answer
93
qUICK sORT
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0) Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, E What is the position of pivot element after completion of first pass?
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0)Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, EWhat is...
User Avatar
2 votes
1 answer
95
quick sort
Is quick sort in-place algorithm?
Is quick sort in-place algorithm?
User Avatar
0 votes
1 answer
98
Algorithm
User Avatar
2 votes
2 answers
100
GATE Overflow | Algorithms | Test 1 | Question: 23
About how many compares will Quicksort() make when sorting an array of N items that are all equal? $\Theta(\lg N)$ $\Theta(N\lg N)$ $\Theta(\lg \lg N)$ $\Theta(N/\lg N)$
About how many compares will Quicksort() make when sorting an array of N items that are all equal?$\Theta(\lg N)$$\Theta(N\lg N)$$\Theta(\lg \lg N)$$\Theta(N/\lg N)$
User Avatar
1 votes
1 answer
102
quick sort
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo then why quick sort is inplace plz explain clearly
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo...
User Avatar
1 votes
2 answers
103
Sorting
What is the Worst Case Space Complexity of Quick Sort?
What is the Worst Case Space Complexity of Quick Sort?
User Avatar
4 votes
1 answer
107
quick sort time complexity
the worst case time complexity of quicksort for an elements when the median is selected as the pivot a. o(n^2) b.o(n) c.o(nlogn) d.o(logn)
the worst case time complexity of quicksort for an elements when the median is selected as the pivota. o(n^2)b.o(n)c.o(nlogn)d.o(logn)
User Avatar
0 votes
2 answers
109
quick sort
Is Quicksort is in place algorithm?
Is Quicksort is in place algorithm?
User Avatar
2 votes
1 answer
110
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
18 votes
3 answers
112
TIFR CSE 2012 | Part B | Question: 14
Consider the quick sort algorithm on a set of $n$ ... $\Theta (n^{2})$. None of the above.
Consider the quick sort algorithm on a set of $n$ numbers, where in every recursive subroutine of the algorithm, the algorithm chooses the median of that set as the pivot...
User Avatar
1 votes
5 answers
113
partitioning
Consider the following array... 12 18 17 11 13 15 16 14 Find the no of elements which will change their position when partitioning algorithm is applied on array .pivot choosen is 15
Consider the following array...12 18 17 11 13 15 16 14Find the no of elements which will change their position when partitioning algorithm is applied on array .pivot cho...
User Avatar
1 votes
1 answer
114
Give the result of partitioning the keys after the 1st pass of quicksort.
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
THISCOURSEISOVERChoose the last elements as pivot elements (R). Also for duplicates, adopt the convention that both pointers stop.a) EHIOCOIERRUSSVTSb) EHISCOIERRUSOVTSb)...
User Avatar
10 votes
2 answers
115
ISRO2015-12
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately $50.2$ sec $6.7$ sec $72.7$ sec $11.2$ sec
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately$50.2$ sec$6.7$ sec$72.7$ sec$...
User Avatar
21 votes
7 answers
116
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
23 votes
3 answers
117
GATE CSE 1992 | Question: 03,iv
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an input for which Quicksort takes maximum time.
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an...
User Avatar
Page: