menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
How to read operating systems concept by galvin?
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
My advice, for now just read the gate syllabus...
Mock 3 will be added soon.
What are the expected dates for release of Mock 3...
Thank You So Much...
Ohh, yeah now turned off. Got it sir, Thank you :)
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Cormen Edition 3 Exercise 7.4 Question 4 (Page No. 184)
0
votes
182
views
Show that
RANDOMIZED-QUICKSORT
’s expected running time is $\Omega(n\ lg\ n)$.
cormen
algorithms
quicksort
time-complexity
descriptive
asked
Jun 28, 2019
in
Algorithms
akash.dinkar12
182
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
proof
answered
Jul 15, 2019
Asim Siddiqui 4
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
2
answers
1
144
views
Cormen Edition 3 Exercise 7.4 Question 2 (Page No. 184)
Show that quicksort’s best-case running time is $\Omega(n\ lg\ n)$.
Show that quicksort’s best-case running time is $\Omega(n\ lg\ n)$.
asked
Jun 28, 2019
in
Algorithms
akash.dinkar12
144
views
cormen
algorithms
quicksort
time-complexity
descriptive
0
votes
1
answer
2
59
views
Cormen Edition 3 Exercise 7.4 Question 3 (Page No. 184)
Show that the expression $q^2 +(n-q-1)^2$ achieves a maximum over $q=0,1,\dots ,n-1$ when $q=0$ or $q=n-1$.
Show that the expression $q^2 +(n-q-1)^2$ achieves a maximum over $q=0,1,\dots ,n-1$ when $q=0$ or $q=n-1$.
asked
Jun 28, 2019
in
Algorithms
akash.dinkar12
59
views
cormen
algorithms
quicksort
descriptive
0
votes
2
answers
3
138
views
Cormen Edition 3 Exercise 7.2 Question 3 (Page No. 178)
Show that the running time of QUICKSORT is $\Theta(n^2)$ when the array $A$ contains distinct elements and is sorted in decreasing order.
Show that the running time of QUICKSORT is $\Theta(n^2)$ when the array $A$ contains distinct elements and is sorted in decreasing order.
asked
Jun 27, 2019
in
Algorithms
akash.dinkar12
138
views
cormen
algorithms
quicksort
time-complexity
descriptive
1
vote
2
answers
4
162
views
Cormen Edition 3 Exercise 7.2 Question 2 (Page No. 178)
What is the running time of QUICKSORT when all elements of the array $A$ have the same value?
What is the running time of QUICKSORT when all elements of the array $A$ have the same value?
asked
Jun 27, 2019
in
Algorithms
akash.dinkar12
162
views
cormen
algorithms
quicksort
time-complexity
descriptive
...
