The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Ace Test Series: Algorithms  Sorting
0
votes
121
views
acetestseries
algorithms
quicksort
asked
Jan 14, 2019
in
Algorithms
by
Shankar Kakde
edited
Mar 4, 2019
by
I_am_winner

121
views
answer
comment
0
Case c is not possible, as quick sort splits the list into two parts
0
option c)
A) When median is selected as pivot
B) When n/3rd smallest element is selected as pivot
D) When n/5th smallest element is selected as pivot.
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answer c is not possible in case of quick sort...
answered
Jan 14, 2019
by
spike500
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
+1
vote
3
answers
1
MadeEasy Test Series: Algorithms  Sorting
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 elements [First element, middle element, and last element]. What will be worst case time complexity of modified quick sort? a.O($n^{2}$) b.O(nlogn) c.O($n^{2}$logn) d.O(nloglogn)
asked
Jan 21, 2019
in
Algorithms
by
newdreamz a1z0

306
views
algorithms
sorting
quicksort
madeeasytestseries
0
votes
2
answers
2
MadeEasy Test Series: Algorithms  Sorting
Is there any standard way to sort in Quicksort or what all matters is PIVOT getting placed at its correct position thats it? I mean if only pivot condition then 3!*3! for both left and right elements but if any standard then each ... after 1st pass the array will remain as it is and only those elements compared with the minimum will be getting swapped.
asked
Dec 27, 2018
in
Algorithms
by
Markzuck

293
views
madeeasytestseries
sorting
algorithms
quicksort
+2
votes
1
answer
3
Ace Test series: Algorithms  Sorting
asked
Jan 7, 2018
in
Algorithms
by
smsubham

241
views
acetestseries
algorithms
sorting
+3
votes
4
answers
4
Ace Test Series: Algorithms  Sorting
Consider bottomup merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n  n + 1 (C) n log n (D) n log n + n
asked
Oct 8, 2017
in
Algorithms
by
Aibi

763
views
mergesort
acetestseries
sorting
algorithms
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
Can you check now?
Even I filled NIELIT form which had similar...
Sir, I clicked 1st test link but When I...
Today's test will be late  either midnight or...
on what time will be today's test?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,517
answers
201,939
comments
95,368
users