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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged sortingalgorithmsquicksort
0
votes
0
answers
1
Cormen Edition 3 Exercise 7.2 Question 4 (Page No. 178)
Banks often record transactions on an account in order of the times of the transactions, but many people like to receive their bank statements with checks listed in order by check number. People usually write checks in order ... sorted input. Argue that the procedure INSERTIONSORT would tend to beat the procedure QUICKSORT on this problem.
asked
Jun 27, 2019
in
Algorithms
by
akash.dinkar12
Boss
(
42.4k
points)

18
views
cormen
algorithms
sortingalgorithmsquicksort
descriptive
0
votes
0
answers
2
#CLRS #Algorithm Doubt about randomized QuickSort.
asked
May 27, 2019
in
Algorithms
by
iarnav
Loyal
(
8.4k
points)

520
views
algorithms
sortingalgorithmsquicksort
sorting
asymptoticnotations
0
votes
2
answers
3
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 26, 2018
in
Algorithms
by
Markzuck
Junior
(
675
points)

168
views
algorithms
madeeasytestseries
sorting
sortingalgorithmsquicksort
0
votes
0
answers
4
chache performance between hoare and loranto quicksort
between hoare and loranto quicksort which give better cache performance ? we know that in hoare quicksort we move the pointer i,j in different direction but in loranto quicksort we move i,j in same direction so the cache performance of loranto should be better?
asked
Nov 13, 2018
in
Algorithms
by
Gurdeep Saini
Boss
(
10.6k
points)

61
views
algorithms
sortingalgorithmsquicksort
sorting
quicksort
0
votes
0
answers
5
Randomized Quicksort
True or False : In randomized quicksort , each key is involved in the same number of comparisons.
asked
Sep 21, 2018
in
Algorithms
by
Vaishnavi01
(
153
points)

64
views
algorithms
sortingalgorithmsquicksort
+1
vote
1
answer
6
3way quicksort
3way partitioning is a modification of quicksort that partitioned the elements into groups smaller than,equal to and larger than pivot. Only the group of smaller and larger elements need to be sorted. If there are N items and K unique value the running time of modified quick sort is (A) O(nlogk) (B) O(klogn) (C) O(nk) (D) O(k^2)
asked
Dec 8, 2017
in
Algorithms
by
manish suthar
(
49
points)

317
views
algorithms
sortingalgorithmsquicksort
sorting
+1
vote
1
answer
7
QUICKSORT
Could anyone describe how the partitioning algorithm vary when the pivot is varied ? In Cormen , last element is taken as pivot . Suppose I took first element or middle element or 3 rd element as pivot then how the partitioning algorithm will change.
asked
Sep 27, 2017
in
Algorithms
by
ashwina
Active
(
1.8k
points)

165
views
algorithms
sorting
sortingalgorithmsquicksort
quicksort
+2
votes
2
answers
8
Algorithm quicksort
Reply with solution @ Habibkhan,@Gabbar,@Arjun Sir
asked
Feb 7, 2017
in
Algorithms
by
Shubham Sharma 2
Loyal
(
5.6k
points)

286
views
algorithms
sortingalgorithmsquicksort
+1
vote
1
answer
9
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.
asked
Nov 18, 2016
in
Algorithms
by
Yogesh Chaure
(
11
points)

198
views
sortingalgorithmsquicksort
+2
votes
1
answer
10
UGCNETSep2013II10
Suppose that the splits at every level of Quicksort are in proportion $1\beta \text{ to } \beta$, where $0 < \beta \leq 0.5$ is a constant. The number of elements in an array is n. The maximum depth is approximately 0.5 $\beta$ Ig n 0.5 (1$\beta$) Ig n (Ig n)/(Ig $\beta$) (Ig n)/Ig (1$\beta$)
asked
Jul 20, 2016
in
Others
by
jothee
Veteran
(
105k
points)

1.4k
views
ugcnetsep2013ii
datastructures
sortingalgorithmsquicksort
0
votes
1
answer
11
UGCNETJune2014III66
Suppose that the splits at every level of quicksort are in the proportion $(1 – \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by $\frac{lgn}{lg(1\alpha)}$ $\frac{lg(1\alpha)}{lgn}$ $\frac{lgn}{lg\alpha}$ $\frac{lg\alpha}{lgn}$
asked
Jul 12, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

633
views
ugcnetjune2014iii
datastructures
sorting
sortingalgorithmsquicksort
To see more, click for the
full list of questions
or
popular tags
.
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 CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Management Trainee Recruitment COAL INDIA 2020
ECIL Interview Experience
Follow @csegate
Recent questions tagged sortingalgorithmsquicksort
Recent Blog Comments
Q42 C option is correct for C set as it is an...
@ smsubham The SQL query question No...
Are SQL query and that case 1, case 2 answer in...
@ Debapaul Correct answer should be...
Question No. 42 (BIG ENDIAN QUESTION) in Set 'C'...
50,737
questions
57,270
answers
198,131
comments
104,777
users