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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
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.
Search results for sorting
+10
votes
4
answers
1
GATE200614, ISRO201114
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort
asked
Sep 17, 2014
in
Algorithms
by
Rucha Shelke
Loyal
(
4.3k
points)

3.4k
views
gate2006
algorithms
sorting
easy
isro2011
+3
votes
5
answers
2
ISRO201715
Which one of the following inplace sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
asked
May 7
in
Algorithms
by
sh!va
Veteran
(
32k
points)

1.3k
views
isro2017
algorithms
sorting
+22
votes
3
answers
3
GATE200429
The tightest lower bound on the number of comparisons, in the worst case, for comparisonbased sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
asked
Sep 19, 2014
in
Algorithms
by
Kathleen
Veteran
(
67.7k
points)

2.5k
views
gate2004
algorithms
sorting
asymptoticnotations
easy
+14
votes
4
answers
4
GATE2012_39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the mergesort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
asked
Sep 26, 2014
in
Algorithms
by
gatecse
Veteran
(
13.6k
points)

2.8k
views
gate2012
algorithms
sorting
normal
+3
votes
0
answers
5
Question on sorted array and time complexity
Which of the following operations can be performed in O(log n) time or faster on a sorted array A? (n denotes the size of array) 1) Search(A, x) 2) FindMinimum(A) 3) Delete(A, x) Choose the correct option: A.) 1 & 3 B.) 1 & 2 C.) 2 & 3 D.) All of them I chose option B but the book says option D is right. Please provide an explanation.
asked
1 day
ago
in
Algorithms
by
Akash Mishra
Junior
(
733
points)

33
views
algorithms
sorting
timecomplexity
binarysearch
+15
votes
3
answers
6
GATE20153_27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
asked
Feb 15, 2015
in
Algorithms
by
jothee
Veteran
(
99.2k
points)

2.2k
views
gate20153
algorithms
sorting
+4
votes
1
answer
7
Inplace Merge Sort via Doubly linked list in place of Array
asked
Nov 2
in
Algorithms
by
Chhotu
Boss
(
7k
points)

61
views
algorithms
sorting
spacecomplexity
linkedlists
complete
timecomplexity
0
votes
1
answer
8
#TestBook
Suppose in an array A[] , we exchange elements A[i] and A[i+k] , which were originally out of order A) at least 1 and at most 2k1 inversions are removed B) at least 2 and at most 2k inversions are removed C)at least 0 and at most k inversions are removed D) none
asked
1 day
ago
in
Algorithms
by
Raj_Choudhary
(
309
points)

32
views
algorithms
sorting
+2
votes
1
answer
9
Sorting
The minimum number of comparisons required to sort 25 elements is ____
asked
Nov 11
in
Algorithms
by
Shivi rao
Junior
(
845
points)

46
views
sorting
algorithms
0
votes
0
answers
10
Question on Inversion and sorting
The average number of inversions in an unsorted array of n elements is? (Two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j) A.) n(n1)/2 B.) n(n1)/4 C.) n(n+1)/2 D.) n!/2
asked
1 day
ago
in
Algorithms
by
Akash Mishra
Junior
(
733
points)

30
views
algorithms
sorting
0
votes
0
answers
11
Merge sort and insertion sort
asked
4 days
ago
in
Algorithms
by
Parshu gate
Loyal
(
3.7k
points)

44
views
algorithms
sorting
mergesort
timecomplexity
+1
vote
0
answers
12
Combined Sorting
A cache aware sorting algorithm sorts an array of size $2^{k}$ with each key of size 4 Bytes. The size of cache memory 128 Bytes. and algorithm is a combination of merge sort and insertion sort to exploit locality of reference for the cache memory(i.e. will use insertion sort when problem size equal ... {5}+log_{2}2^{k5} \right ]$ 2)$2^{k5}\left [ 2^{5}+log_{2}2^{k5} \right ]$
asked
Nov 11
in
Algorithms
by
srestha
Veteran
(
70.4k
points)

44
views
sorting
algorithms
+1
vote
2
answers
13
test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n1 and m+n1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n1 and min(m,n) can someone give the worst case and best case with examples ?
asked
Nov 4
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

44
views
algorithms
sorting
normal
0
votes
1
answer
14
ugc net November 2017
You are given a sequence of n elements to sort. The input sequence consist of n/k subsequences, each containing K elements. The elements in a given sequence are all smaller than the elements in the succeeding and larger than the elements in the preceding subsequence. Thus, all that is needed to ... problem is: 1. Omega (n) 2. Omega (n/k) 3. Omega (n lg k) 4. Omega (n/k lg n/k)
asked
Nov 8
in
Algorithms
by
iarnav
Boss
(
5.4k
points)

36
views
sorting
algorithms
+3
votes
1
answer
15
Modified form of GATE1996_2.15
Quicksort is run on two inputs shown below to sort in ascending order taking first element as pivot i) 1,2,3,…n ii) n,n−1,n−2,…,2,1 Let S1 and S2 be the number of swaps made for the inputs (i) and (ii) respectively. Then, i) How is S1 and S2 related ? ii) How will the answer change if the pivot is changed to middle element ?
asked
Oct 18
in
Algorithms
by
rishi71662data4
Active
(
1.8k
points)

70
views
algorithms
datastructure
sorting
quicksort
0
votes
2
answers
16
Algorithm: Selection Sort
Consider the following code which sort all elements of an array A' in descending order. Which of the following will represents correct value of X, Y, Z in above code for selection sort? a. i > 0, K > 0, a[K] > a[max] b. i ... the array in the descending order but by using option a it is aranging in ascending order. And option D is doing what question is saying.
asked
Sep 24
in
Algorithms
by
Shubhanshu
Veteran
(
11.3k
points)

57
views
algorithms
sorting
selectionsort
+3
votes
1
answer
17
Merge sort
True or False Merge sort on Linked list takes O(nlogn)
asked
Oct 10
in
DS
by
Shivi rao
Junior
(
845
points)

119
views
mergesort
algorithms
sorting
timecomplexity
+1
vote
0
answers
18
Sorting
If we are asked to find best comparison based sorting algorithm to sort n numbers having d digit's and in the range from [1k]. If I say it is quick sort or merge sort or heap sort is it wrong ? OR in general we do sorting on these type of numbers using Radix sort only ?
asked
Oct 29
in
Algorithms
by
junaid ahmad
Boss
(
9.6k
points)

38
views
sorting
+11
votes
5
answers
19
GATE19871xviii
Let $P$ be a quicksort program to sort numbers in ascending order. Let $t_{1}$ and $t_{2}$ be the time taken by the program for the inputs $[1 \ 2 \ 3 \ 4]$ and $[5 \ 4 \ 3 \ 2 \ 1]$, respectively. Which of the following holds? $t_{1} = t_{2}$ $t_{1} > t_{2}$ $t_{1} < t_{2}$ $t_{1}=t_{2}+5 \log 5$
asked
Nov 9, 2016
in
Algorithms
by
makhdoom ghaya
Veteran
(
42.9k
points)

900
views
gate1987
algorithms
sorting
0
votes
0
answers
20
MERGE SORT
IS 2 way merge sort and normal merge sort is same.in which we have to use bottomup merging approach by taking 22 element inside the list.if 5way merge sort then in the list we have to take 55 elements from bottom to up for merging. if I am wrong please let me correct!
asked
Oct 28
in
Algorithms
by
learner_geek
Loyal
(
3.2k
points)

47
views
mergesort
algorithms
sorting
timecomplexity
Page:
1
2
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for sorting
Recent Blog Comments
Hi Guys, I think this is not correct. ISRO ...
NIELIT specifically mailed that they decided ...
is there any chances of changing the exam date??
ISRO and NIELIT Exam on the same day i.e 17th ...
greatly said @papesh sir
29,138
questions
36,959
answers
92,026
comments
34,803
users