The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 mergesort
0
votes
0
answers
1
Cormen Edition 3 Exercise 2.3 Question 2 (Page No. 37)
Rewrite the MERGE procedure so that it does not use sentinels, instead of stopping once either array $L$ or $R$ has had all its elements copied back to $A$ and then copying the remainder of the other array back into $A$.
asked
Jun 26, 2019
in
Algorithms
by
akash.dinkar12

57
views
cormen
algorithms
sorting
mergesort
descriptive
0
votes
1
answer
2
Cormen Edition 3 Exercise 2.3 Question 1 (Page No. 37)
Using Figure $2.4$ as a model, illustrate the operation of merge sort on the array $A=\langle 3,41,52,26,38,57,9,49 \rangle $
asked
Jun 26, 2019
in
Algorithms
by
akash.dinkar12

58
views
cormen
algorithms
sorting
mergesort
descriptive
0
votes
1
answer
3
Total number of function calls in Merge sort Algorithm
In Merge sort Algorithm when I took input array of size 2 and I got 4 function calls as including original function call with which I call MS algorithm i.e. MS (1,2) and which in turn calls two recursive function calls to merge ... function calls. So, how can I analyze the total number of function calls when input array size is n? thank you!
asked
Apr 25, 2019
in
Algorithms
by
iarnav

241
views
algorithms
mergesort
sorting
+1
vote
1
answer
4
Vani Question Bank
Find the total number of comparisons if merge sort is used. Explain with proper steps. 2, 5, 8, 4, 1, 7, 6, 3 Total no of comparison.
asked
Apr 8, 2019
in
Algorithms
by
Hirak

103
views
algorithms
mergesort
0
votes
0
answers
5
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 22, 2019
in
Algorithms
by
Nandkishor3939

163
views
mergesort
algorithms
sorting
0
votes
1
answer
6
Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$
asked
Jan 20, 2019
in
Algorithms
by
kumar.dilip

115
views
algorithms
mergesort
0
votes
0
answers
7
mergesort
is mergesort inplace on linked list? it is not inplace on array
asked
Jan 17, 2019
in
Algorithms
by
Rahul_Rathod_

80
views
mergesort
0
votes
0
answers
8
Merge Sort
Can anyone help me to understand this problem….??
asked
Jan 9, 2019
in
Algorithms
by
Vikas123

201
views
mergesort
algorithms
sorting
merging
0
votes
1
answer
9
MadeEasy Subject Test 2019: Algorithms  Sorting
asked
Dec 21, 2018
in
Algorithms
by
Ramij

144
views
madeeasytestseries
algorithms
sorting
mergesort
0
votes
1
answer
10
Merge Sort
What mean by First Pass of algorithm and Second Pass of algorithm in a 2way Merge Sort Algorithm ?
asked
Dec 8, 2018
in
Algorithms
by
Dhiraj Raj

162
views
mergesort
algorithms
0
votes
2
answers
11
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

381
views
algorithms
sorting
quicksort
mergesort
0
votes
1
answer
12
Merge Sort Inplace
no of comparisons in merge sort max? how many max no swaps??[if inplace algo]
asked
Nov 25, 2018
in
Algorithms
by
Abhisek Tiwari 4

95
views
mergesort
+1
vote
1
answer
13
MadeEasy Test Series: Algorithms  Sorting
asked
Nov 22, 2018
in
Algorithms
by
Shamim Ahmed

184
views
madeeasytestseries
algorithms
sorting
mergesort
0
votes
0
answers
14
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
asked
Nov 4, 2018
in
Algorithms
by
suneetha

86
views
mergesort
0
votes
0
answers
15
merge sort
what is the time complexity of merge sort for already sorted array explain with example?
asked
Nov 3, 2018
in
Algorithms
by
suneetha

76
views
mergesort
+3
votes
0
answers
16
Merge sort
How many swaps are performed in Merge sort algorithm in worst case?
asked
Oct 9, 2018
in
Algorithms
by
Kaushal Sanadhya

337
views
mergesort
algorithms
sorting
merging
0
votes
2
answers
17
Merge Sort Doubt
what is the recurrence relation for merge sort?
asked
Oct 6, 2018
in
Algorithms
by
aditi19

222
views
mergesort
algorithms
timecomplexity
recurrencerelations
sorting
divideandconquer
0
votes
1
answer
18
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
asked
Sep 26, 2018
in
DS
by
aditi19

74
views
linkedlists
mergesort
+3
votes
1
answer
19
Gateforum Test Series: Algorithms  Sorting
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n1 d)nlogn
asked
Aug 23, 2018
in
Algorithms
by
Prince Sindhiya

215
views
gateforumtestseries
algorithms
sorting
mergesort
0
votes
0
answers
20
Merge Sort (Code)
why this margeSort program showing time limit exceed ? #include <stdio.h> #include <stdlib.h> #include <time.h> void fillArray(int array[], int n) { time_t t; time(&t);//get current time srand(t);//gives current time as seed ... CLOCKS_PER_SEC; printArray(Array, n); printf("\n \n Time taken for sorting: %f seconds\n\n",cpu_time_used); return 0; }
asked
Aug 18, 2018
in
Programming
by
srestha

97
views
mergesort
algorithms
sorting
0
votes
0
answers
21
Made Easy algorithms
Given an array of n elements, two elements in the array a[i] and a[j] are said to be inverse only if a[i]>a[j] && i<j. What is the time complexity required to find the number of inverses in the given array using merge sort? a) O(n) b) O(n2) c) O(nlogn) d) O(logn)
asked
Aug 6, 2018
in
Algorithms
by
Sambhrant Maurya

71
views
algorithms
mergesort
timecomplexity
0
votes
2
answers
22
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the mergesort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
asked
Jul 8, 2018
in
Algorithms
by
pradeepchaudhary

310
views
mergesort
algorithms
sorting
merging
+2
votes
2
answers
23
Merge Sort
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is  a) 8/3 b) 8/5 c) 11/7 d) 11/6
asked
Jul 1, 2018
in
Algorithms
by
garvit_vijai

2.7k
views
mergesort
merging
timecomplexity
+1
vote
2
answers
24
Ace Question 10
asked
Jun 29, 2018
in
Algorithms
by
Na462

120
views
algorithms
mergesort
+2
votes
1
answer
25
Merge sort
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
asked
Jun 26, 2018
in
Algorithms
by
Naveen Parihar

189
views
mergesort
algorithms
0
votes
0
answers
26
Sorting
You are asked to sort 15 randomly generated numbers. One should prefer  1. Bubble Sort 2. Quick Sort 3. Merge Sort 4. Heap Sort Please explain why others 3 sorting algorithms except the answer can't be used ?
asked
Jun 16, 2018
in
Algorithms
by
Rahul Ranjan 1

190
views
sorting
algorithms
timecomplexity
heapsort
mergesort
+1
vote
0
answers
27
Ace Test Series: Algorithm  Merge Sort
asked
Jun 11, 2018
in
Algorithms
by
Shankar Kakde

226
views
acetestseries
algorithms
mergesort
0
votes
1
answer
28
merge sort
Why do we say Merge sort makes good use of locality of reference? and if I have $1 \hspace{0.1cm} billion$ elements and my memory can only store $1 \hspace{0.1cm} million$ elements at a time. How would I use merge sort to sort this?
asked
May 26, 2018
in
Algorithms
by
Kiran Karwa

264
views
mergesort
algorithms
+1
vote
1
answer
29
Merge sort algorithm
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort? Is there any improvement over standard merge sort?
asked
Mar 9, 2018
in
Algorithms
by
rahul sharma 5

469
views
algorithms
mergesort
sorting
timecomplexity
+2
votes
2
answers
30
Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
asked
Jan 31, 2018
in
Algorithms
by
VS

587
views
mergesort
algorithms
sorting
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
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged mergesort
Recent Blog Comments
........
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,315
questions
60,432
answers
201,766
comments
95,245
users