Register

Recent questions tagged merge-sort

228
views
0 answers
0 votes
Merge Sort
Calculate the minimum and maximum number of element comparisons involved in 2 way merge sort assuming n is power of 2.
User Avatar
713
views
2 answers
2 votes
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].$ We apply a certain sorting algorithm and observe that the ... applied?Merge sort (top-down approach)Bubble sortQuicksort (Using First element as pivot)Insertion sort
User Avatar
889
views
1 answers
4 votes
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 ... $\theta(k \log n)$
User Avatar
460
views
1 answers
3 votes
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 ... $ in its $7$th position.)$3$1$2$4$
User Avatar
1.0k
views
1 answers
1 votes
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 ... worst case complexity $O(n log n)$.plese give answer and explain it why ?
User Avatar
350
views
1 answers
2 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 23
Which of the following is/are TRUE?In the worst case, merge sort runs in $O\left(n^2\right)$ time.Depth-first search of a graph is asymptotically faster than ... a binary search tree leaves the same tree as inserting $y$ and then $x$.
User Avatar
1.5k
views
1 answers
7 votes
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 ... 2 T(n / 2)+n$T(n)=2 T(n / 2)+n^ 3$None of these
User Avatar
919
views
1 answers
2 votes
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$)
User Avatar
490
views
0 answers
0 votes
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 ... a file of 105 pages. The cost of sorting using m-way merge sort is__ ?
User Avatar
1.7k
views
5 answers
6 votes
NIELIT 2017 DEC Scientific Assistant A - Section B: 39
Merge sort uses :Divide-and-conquerBacktrackingHeuristic approachGreedy approach
User Avatar
1.9k
views
5 answers
5 votes
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$
User Avatar
623
views
0 answers
0 votes
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$.
User Avatar
1.8k
views
1 answers
1 votes
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 $
User Avatar
4.1k
views
4 answers
1 votes
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 ... analyze the total number of function calls when input array size is n?thank you!
User Avatar
997
views
1 answers
0 votes
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, 3Total no of comparison.
User Avatar
733
views
0 answers
0 votes
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)
User Avatar
731
views
1 answers
1 votes
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}$
User Avatar
Page: