The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged sorting
0
votes
0
answers
1
Can Merge Sort Time Complexity be O(n^2) in any condition?
asked
Feb 1
in
Algorithms
by
aditykansara
(
23
points)

78
views
algorithms
timecomplexity
sorting
0
votes
1
answer
2
ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted array as output. Here's the pseudocode for RumbleSort. With regards to the above RumbleSort ... algorithm will work correctly for a given input is $\mathcal Ο(n^2)$ Which of the above statements is/are true?
asked
Jan 30
in
Algorithms
by
balchandar reddy san
Active
(
2.7k
points)

89
views
timecomplexity
algorithms
sorting
0
votes
2
answers
3
DAA: LInked list and sorted array
Suppose that two repositories exist for storing and searching through a certain type of record. The first repository uses a linked list; on average, it requires $10$ ms to search $1024$ records, or $10240$ ms to search $1048576$ records. ... two versions require approximately equal time, on average? 1. 2048 records 2. 4096 records 3. 16384 records 4. 65536 records
asked
Jan 23
in
Algorithms
by
chauhansunil20th
Active
(
4.8k
points)

61
views
algorithms
linkedlists
sorting
0
votes
0
answers
4
Merge sort
What is the extra memory needed for merge sort: 1] In case of Iterative merge sort.(DS:Array) 2]In case of Recursive merge sort.(DS:Array) 3] In case of Iterative merge sort.(DS:Linked List) 4]In case of Recursive merge sort.(DS:Linked List)
asked
Jan 21
in
Algorithms
by
Nandkishor3939
Active
(
1.2k
points)

46
views
mergesort
algorithms
sorting
+1
vote
0
answers
5
GATEBOOK2019 Mock Test125
Which of the following sorting algorithm has a running time that is least dependent on the initial ordering of the inputs? Quick sort. Insertion sort. Merge sort Selection sort
asked
Jan 19
in
Algorithms
by
GATEBOOK
Boss
(
15.3k
points)

210
views
gb2019mock1
sorting
0
votes
1
answer
6
sorted list
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(log n) ) b) O ( log n log(log m) ) c) O ( log m log n) d) O ( m log log n)
asked
Jan 16
in
Algorithms
by
Rahul_Rathod_
Junior
(
565
points)

49
views
algorithms
sorting
timecomplexity
0
votes
0
answers
7
ME_test_series
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the best choice for sorting the array A? A.) quick sort B.) insertion sort C.) selection sort D.) bubble sort I can’t understand how can insertion sort be better in this case?
asked
Jan 13
in
Algorithms
by
Shivam Kasat
Active
(
1.9k
points)

54
views
algorithms
sorting
0
votes
0
answers
8
Merge Sort
Can anyone help me to understand this problem….??
asked
Jan 8
in
Algorithms
by
Vikas123
(
359
points)

55
views
mergesort
algorithms
sorting
merging
+1
vote
1
answer
9
GO2019FLT162
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is? $\text{Insertion sort, } O(\log ^2 n)$ $\text{Merge sort, } \Theta (( \log n) \log (\log n ))$ $\text{Heap sort, } \Theta ( \log ^2)(\log n ))$ $\text{Quick sort, } O ( \log 2)(\log n ))$
asked
Dec 27, 2018
in
Algorithms
by
Ruturaj Mohanty
Active
(
2.9k
points)

151
views
go2019flt1
sorting
0
votes
1
answer
10
Madeeasy DAAQuicksort 2019
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 of the ... way that 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
(
635
points)

66
views
algorithms
madeeasytestseries
sorting
sortingalgorithmsquicksort
0
votes
0
answers
11
Highest best case implies worst case?
Which of the below given sorting techniques has highest bestcase runtime complexity. (A) Quick sort (B) Selection sort (C) Insertion sort (D) Bubble sort Answer: (B) Explanation: Quick sort best case time complexity is Ο(n logn) Selection sort ... 12/ I did not understand this as best case time should be O(n) sorting method what does highest best cases mean?
asked
Dec 23, 2018
in
Algorithms
by
sripo
Active
(
1.5k
points)

49
views
algorithms
asymptoticnotations
datastructure
sorting
timecomplexity
0
votes
0
answers
12
Self Doubt
Please correct if any of the point is wrong : Quicksort: 1.Need more random accesses 2 Used when Random access is fast (hence preferred on array and not on Linked List) 2 No extra space needed ==> Inplace 4 Not a stable sorting algorithm ... : Quicksort in particular exhibits good cache locality and this makes it faster than merge sort in many cases like in virtual memory environment.
asked
Dec 21, 2018
in
Programming
by
jatin khachane 1
Loyal
(
6.4k
points)

50
views
programming
datastructure
sorting
0
votes
1
answer
13
#madeeasy
asked
Dec 21, 2018
in
Algorithms
by
Ramij
(
353
points)

53
views
madeeasytestseries
algorithms
sorting
–1
vote
0
answers
14
Made easy Test
Which of the following sorting algorithm represented by above code?
asked
Dec 19, 2018
in
Programming
by
Abhishek Kumar 38
(
105
points)

72
views
sorting
datastructure
madeeasytestseries
0
votes
0
answers
15
Self doubt
The tightest lower bound on the number of comparisons, in the worst case, for comparisonbased sorting is The tightest upper bound on the number of comparisons, in the worst case, for comparisonbased sorting is The tightest lower bound on the number of ... comparisonbased sorting is The tightest upper bound on the number of comparisons, in the best case, for comparisonbased sorting is
asked
Dec 13, 2018
in
Algorithms
by
jatin khachane 1
Loyal
(
6.4k
points)

23
views
algorithms
sorting
0
votes
0
answers
16
made_easy_test_2019 (Algorithms)
explain how to solve the above question !
asked
Dec 11, 2018
in
Algorithms
by
air1ankit
Active
(
4.3k
points)

79
views
algorithms
sorting
0
votes
1
answer
17
GATE200322 Self doubt
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the ... case will be O(nlogn) because here no matter what the binary search will be performed for every element. Can someone confirm?
asked
Dec 3, 2018
in
Algorithms
by
Mk Utkarsh
Boss
(
34.1k
points)

98
views
algorithms
sorting
0
votes
0
answers
18
Adaptive sorting Algorithm.
Is Quick sort an adaptive sorting Algorithm? I think no. Because as per the definition given in the Wikipedia is that A adaptive sorting Algorithm is one who takes the advantage of preorderedness of the input. But in case of Quick sort it act as disadvantage.
asked
Dec 1, 2018
in
Algorithms
by
Shubhanshu
Boss
(
18.9k
points)

40
views
algorithms
sorting
quicksort
mergesort
0
votes
1
answer
19
Kth Largest element in MinHeap
What is the time complexity to find the Kth largest element in a MinHeap? Or equivalently, What is the time complexity to find Kth smallest element in MaxHeap?
asked
Dec 1, 2018
in
Algorithms
by
gmrishikumar
Active
(
1.7k
points)

128
views
algorithms
heap
binaryheap
timecomplexity
sorting
0
votes
0
answers
20
Self Doubt
Please explain me the difference between the following questions and their answers. All seems similar to me with different answers. https://gateoverflow.in/2048/gate2014314 https://gateoverflow.in/1830/gate200652 https://gateoverflow.in/25209/tifr2012b14
asked
Nov 30, 2018
in
Algorithms
by
Gupta731
Active
(
4.5k
points)

42
views
algorithms
sorting
0
votes
0
answers
21
Max heap when stored in an array is always in sorted order
This question is in CLRS,if we have a max heap it is always in sorted order(descending) order.And by extension if we have min heap the array is sorted in ascending order.Is this true? I have a counter example for ... it an heapified representation or not? If we heapify after deletion and store max deleted element then we get sorted array.
asked
Nov 15, 2018
in
DS
by
sripo
Active
(
1.5k
points)

117
views
sorting
binaryheap
arrays
heap
datastructure
algorithms
0
votes
0
answers
22
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
Loyal
(
8.3k
points)

38
views
algorithms
sortingalgorithmsquicksort
sorting
quicksort
0
votes
0
answers
23
Self doubt on sorting
$(1)$Give $"logn"$ Sorted lists each of size $"\frac{n}{logn}",$what is the total time required to merge them into one single list? $(2)"n"$ strings each of length $"n"$ are given them, what is the time ... $O(n)$ time algorithm.What is the worst case time complexity of quicksort?
asked
Nov 1, 2018
in
Algorithms
by
Lakshman Patel RJIT
Boss
(
29k
points)

86
views
algorithms
sorting
0
votes
0
answers
24
Self doubt on sorting algorithm
What is the average case time complexity of the best sorting algorithm for an array having 2^n^2 elements . I know that the best sorting algorithm is no better than O(n log n).Please answer in terms of the asymptotic notation.
asked
Oct 27, 2018
in
Algorithms
by
argha1992
(
19
points)

27
views
sorting
algorithms
discretemathematics
0
votes
0
answers
25
TANCET 2011 SORTING
An array has 5 elements. Calculate the following: SL. NO: NAME ARRAY IS ALREADY SORTED ARRAY IS REVERSE SORTED ELEMENT COMPARSIONS ELEMENT EXCHANGES ELEMENT COMPARISONS ELEMENT EXCHANGES 1 BUBBLE SORT ? ? ? ? 2 SELECTION SORT ? ? ? ? 3 INSERTION SORT ? ? ? ? 4 QUICK SORT ? ? ? ? 5 MERGE ... ? ? 6 RADIX SORT ? ? ? ? 7 HEAP SORT ? ? ? ? 8 TREE SORT ? ? ? ? 9 COUNTING SORT ? ? ? ?
asked
Oct 24, 2018
in
Algorithms
by
Balaji Jegan
Active
(
4.8k
points)

62
views
tancet
sorting
algorithms
0
votes
0
answers
26
sorting
just tell me about the quick sort
asked
Oct 21, 2018
in
Algorithms
by
Prince Sindhiya
Loyal
(
6.2k
points)

113
views
sorting
algorithms
0
votes
1
answer
27
Insertion Sort
Consider following Statements : S1 : On any random input insertion Sort works more efficiently then Bubble Sort. S2 : Average number of Comparison of Insertion Sort is better then bubble sort by a constant Factor. If efficiency is considered as number of comparisons to sort an Input Array Which of Following is Correct ? A. Only S1 B. Only S2 C. Both S1 and S2 D. None
asked
Oct 20, 2018
in
Algorithms
by
Na462
Loyal
(
8.6k
points)

77
views
algorithms
sorting
Page:
1
2
3
4
5
6
...
9
next »
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
Challenge to GATE keys: Question 26, If you also want to challenge the same, as I did!
How to follow Standard Textbooks?
Gate contest link is now open
Official keys are out now.
JEST 2019 MEMORY BASED QUESTION PAPER
Follow @csegate
Recent questions tagged sorting
Recent Blog Comments
It's good for a democracy to have different view...
Yes , I agree , peace , fighting all around
Let the GATE authority decides!!! we are the not...
Surely will . The other person who has got it...
47,919
questions
52,324
answers
182,341
comments
67,778
users