Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
#selfDoubt
BHOJARAM
asked
in
Algorithms
Dec 17, 2021
227
views
0
votes
0
votes
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst case?
divide-and-conquer
BHOJARAM
asked
in
Algorithms
Dec 17, 2021
by
BHOJARAM
227
views
answer
comment
Follow
share this
share
4 Comments
Show 3 previous comments
by
AngshukN
commented
Dec 17, 2021
reply
Follow
share this
How can you divide the array into two equal parts since the pivot itself is same as the rest of the elements
0
0
by
raja11sep
commented
Dec 17, 2021
reply
Follow
share this
It is given in the question.
0
0
by
palashbehra5
commented
Dec 24, 2021
reply
Follow
share this
Or you can just pick the midpoint every time. Given that all elements are the same.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
[ Jiren ]
asked
in
Algorithms
Aug 28
139
views
Divide and conquer
How To Solve This Using Divide And Conquer Suppose we are given the two n bit integers, assuming for common sense n as power of 2. It is required to multiply them using Divide & conquer method. What is the divide & conquer recurrence, that would arise for the problem. 1. T(n) = 4T(n/2) + O(1) 2. T(n) = 2T(n/2) + O(n) 3. T(n) = 4T(n/2) + O(n^2) 4. T(n) = 4T(n/2) + O(n)
[ Jiren ]
asked
in
Algorithms
Aug 28
by
[ Jiren ]
139
views
algorithms
divide-and-conquer
recurrence-relation
1
vote
1
vote
1
answer
2
lalitver10
asked
in
Algorithms
Jan 4
395
views
Self doubts
T(n)=T(n/5)+T(7n/10)+an a: constant what will be the time complexity of the above recurrence relation?? Please share the approach for this kind of recurrence relation
lalitver10
asked
in
Algorithms
Jan 4
by
lalitver10
395
views
algorithms
recurrence-relation
time-complexity
divide-and-conquer
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy