Dark Mode

Recent questions tagged merge-sort

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.

Ujjal Das asked in Algorithms Mar 17

84 views

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

GO Classes asked in Algorithms Feb 5

508 views

3 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)$

GO Classes asked in Algorithms Jan 28

710 views

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$

GO Classes asked in Algorithms Jan 13

351 views

1 vote

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 ?

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

858 views

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

GO Classes asked in Algorithms Mar 26, 2023

965 views

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

rsansiya111 asked in Algorithms Dec 8, 2021

837 views

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__ ?

samir757 asked in Algorithms Nov 5, 2021

453 views

6 votes

5 answers

9

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

admin asked in Algorithms Mar 31, 2020

by admin

1.6k views

5 votes

5 answers

10

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$

admin asked in Algorithms Mar 31, 2020

by admin

1.8k views

0 votes

0 answers

11

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

akash.dinkar12 asked in Algorithms Jun 26, 2019

by akash.dinkar12

602 views

1 vote

1 answer

12

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 $

akash.dinkar12 asked in Algorithms Jun 26, 2019

by akash.dinkar12

1.7k views

1 vote

4 answers

13

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!

iarnav asked in Algorithms Apr 25, 2019

by iarnav

3.9k views

0 votes

1 answer

14

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.

Hirak asked in Algorithms Apr 7, 2019

by Hirak

949 views

0 votes

0 answers

15

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)

Nandkishor3939 asked in Algorithms Jan 21, 2019

by Nandkishor3939

693 views

1 vote

1 answer

16

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

kumar.dilip asked in Algorithms Jan 19, 2019

687 views

Page:

1
2
3
4
next »

Recent questions tagged merge-sort