Register

Search results for merge-sort

48 votes
2 answers
2
GATE CSE 1999 | Question: 1.14, ISRO2015-42
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$then the o...
User Avatar
0 votes
0 answers
4
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.
User Avatar
1 votes
2 answers
6
geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...
User Avatar
0 votes
3 answers
9
Merge Sort Doubt
what is the recurrence relation for merge sort?
what is the recurrence relation for merge sort?
User Avatar
2 votes
1 answer
11
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...
User Avatar
4 votes
2 answers
12
UGC NET CSE | December 2013 | Part 2 | Question: 25
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 $\times$ n max(m, n) min(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 bem $\times$ nmax(m, n)min(m, ...
User Avatar
1 votes
1 answer
13
Algorithms [2 way merge]
Is 2 way merge behaves same as we do in merge sort?Dividing into groups of two from top to bottom or does it start from bottom to top by mergeing two elements at a time.?Please share example for understanding
Is 2 way merge behaves same as we do in merge sort?Dividing into groups of two from top to bottom or does it start from bottom to top by mergeing two elements at a time.?...
User Avatar
1 votes
3 answers
14
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of d...
User Avatar
3 votes
2 answers
15
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
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is -a) 8/3b) 8/5c) 11/7d) 11/6
User Avatar
5 votes
5 answers
20
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,...
User Avatar
Page: