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
probability of split in partitioning procedure of quicksort
gate_forum
asked
in
Algorithms
Dec 19, 2015
279
views
0
votes
0
votes
consider modifying partitioning procedure of quicksort by randomly picking up three elements from array and computing their median(middle of 3 elts). Approximate probablility of getting at worst ab a to (1-a) split in the range 0<a<1?
gate_forum
asked
in
Algorithms
Dec 19, 2015
by
gate_forum
279
views
answer
comment
Follow
share this
share
0 Comments
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
2
votes
2
votes
1
answer
1
gate_forum
asked
in
Algorithms
Dec 18, 2015
742
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
gate_forum
asked
in
Algorithms
Dec 18, 2015
by
gate_forum
742
views
algorithms
probability
quick-sort
1
vote
1
vote
1
answer
2
Saurabh Sharma
asked
in
Algorithms
Jul 22, 2015
1,067
views
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
Saurabh Sharma
asked
in
Algorithms
Jul 22, 2015
by
Saurabh Sharma
1.1k
views
sorting
algorithms
quick-sort
0
votes
0
votes
0
answers
3
S Ram
asked
in
Algorithms
Jan 15, 2017
226
views
Please provide procedure to solve this sum of probability in hashing.
please help to solve this...
S Ram
asked
in
Algorithms
Jan 15, 2017
by
S Ram
226
views
algorithms
0
votes
0
votes
1
answer
4
dhruba
asked
in
Algorithms
Jun 5, 2023
419
views
Consider performing QuickSort on an array of n distinct elements. What is the probability that no comparisons will be made between the smallest and largest element?
dhruba
asked
in
Algorithms
Jun 5, 2023
by
dhruba
419
views
algorithms
quick-sort
probability
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
