Recent questions tagged merge-sort / GATE Overflow for GATE CSE

0 votes

0 answers

1

Merge Sort
Calculate the minimum and maximum number of element comparisons involved in 2 way merge sort assuming n is power of 2.

Calculate the minimum and maximum number of element comparisons involved in 2 way merge sort assuming n is power of 2.

Ujjal Das

137 views

Ujjal Das asked Mar 17

2 votes

2 answers

2

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 20
Consider the following array$: [32, 33, 5, 2, 14, -4, 22, 39, 34, -9].$ ... sorting algorithms could we possibly have applied? Merge sort (top-down approach) Bubble sort Quicksort (Using First element as pivot) Insertion sort

Consider the following array$: [32, 33, 5, 2, 14, -4, 22, 39, 34, -9].$ We apply a certain sorting algorithm and observe that the array has been modified to $[2, 5, 14, 3...

GO Classes

576 views

GO Classes asked Feb 5

4 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 15
Professor Fiorina uses the following algorithm to merge $k$ sorted lists, each containing $n / k$ elements. She takes the first list and merges it with the second list using a linear-time algorithm for merging two sorted lists (If there are two lists, the ... $\theta(n)$ $\theta(n k)$ $\theta(\mathrm{n} \log k )$ $\theta(k \log n)$

Professor Fiorina uses the following algorithm to merge $k$ sorted lists, each containing $n / k$ elements.She takes the first list and merges it with the second list usi...

GO Classes

770 views

GO Classes asked Jan 28

3 votes

1 answer

4

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 24
Here is an array of ten integers$: 5389170264$ Suppose we run MergeSort on this array. What is the number in the $7$th position of the partially sorted array after the outermost two recursive calls have completed (i.e., just before the very last Merge ... for example, the input array has a $0$ in its $7$th position.) $3$ $1$ $2$ $4$

Here is an array of ten integers$: 5389170264$Suppose we run MergeSort on this array. What is the number in the $7$th position of the partially sorted array after the out...

GO Classes

371 views

GO Classes asked Jan 13

1 votes

1 answer

5

Made Easy Test Series 2024
Which of the following statement(s) is/are true? (a) Quicksort and merge sort are both examples of divide and conquer algorithms. (b) If we randomly choose a pivot element each time, quicksort will always terminate in time $O(n log n).$ (c) For every fixed ... in time $O(1)$, quicksort would have worst case complexity $O(n log n)$. plese give answer and explain it why ?

Which of the following statement(s) is/are true?(a) Quicksort and merge sort are both examples of divide and conquer algorithms.(b) If we randomly choose a pivot element ...

Ray Tomlinson

860 views

Ray Tomlinson asked Aug 9, 2023

7 votes

1 answer

6

GO Classes 2023 | IIITH Mock Test 1 | Question: 12
A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only two arrays. If there are two arrays, then, as a base case, the algorithm combines or merges both in cost of ... $T(n)=2 T(n / 2)+n$ $T(n)=2 T(n / 2)+n^ 3$ None of these

A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only...

GO Classes

1.1k views

GO Classes asked Mar 26, 2023

2 votes

1 answer

7

NPTEL Assignment Question
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be? O($n^2$) O($n^2$ log3n) O(n log2n) O(n $(log2n)^2$)

Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge.What would the worst-case complexity of this ver...

rsansiya111

871 views

rsansiya111 asked Dec 8, 2021

0 votes

0 answers

8

Gate Applied Course Practice test 4
External Merge Sort is necessary when you cannot store all the data into memory. The best you can do is break the data into sorted runs and merge the runs in subsequent passes. The length of a run is tied to your available buffer size. Assume that 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is__ ?

External Merge Sort is necessary when you cannot store all the data into memory. The best you can do is break the data into sorted runs and merge the runs in subsequent p...

samir757

459 views

samir757 asked Nov 5, 2021

1 votes

1 answer

9

GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 2
Consider the following array of elements being sorted by merge sort. The sum of all the elements to which $13$ gets compared is _____ $14\; 13\; 24\; 56\; 87\; 98\; 4\; 65$

Consider the following array of elements being sorted by merge sort. The sum of all the elements to which $13$ gets compared is _____$$14\; 13\; 24\; 56\; 87\; 98\; 4\; 6...

gatecse

153 views

gatecse asked Aug 30, 2020

6 votes

5 answers

10

NIELIT 2017 DEC Scientific Assistant A - Section B: 39
Merge sort uses : Divide-and-conquer Backtracking Heuristic approach Greedy approach

Merge sort uses :Divide-and-conquerBacktrackingHeuristic approachGreedy approach

admin

1.6k views

admin asked Mar 31, 2020

5 votes

5 answers

11

NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$

Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...

admin

1.9k views

admin asked Mar 31, 2020

0 votes

0 answers

12

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$.

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 copyi...

akash.dinkar12

606 views

akash.dinkar12 asked Jun 26, 2019

1 votes

1 answer

13

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 $

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 $

akash.dinkar12

1.8k views

akash.dinkar12 asked Jun 26, 2019

1 votes

4 answers

14

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!

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 ...

iarnav

4.0k views

iarnav asked Apr 25, 2019

0 votes

1 answer

15

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.

Find the total number of comparisons if merge sort is used. Explain with proper steps.2, 5, 8, 4, 1, 7, 6, 3Total no of comparison.

Hirak

951 views

Hirak asked Apr 7, 2019

0 votes

0 answers

16

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)

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...

Nandkishor3939

698 views

Nandkishor3939 asked Jan 21, 2019

1 votes

1 answer

17

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}$

The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.Ans: $\frac{8}{3}$

kumar.dilip

685 views

kumar.dilip asked Jan 19, 2019

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