Register

Search results for merging

0 votes
1 answer
2
DSA
Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.
Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.
User Avatar
3 votes
2 answers
4
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
3 votes
1 answer
5
Merge sort
How many swaps are performed in Merge sort algorithm in worst case?
How many swaps are performed in Merge sort algorithm in worst case?
User Avatar
0 votes
3 answers
6
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) (B) (C) (D)...
User Avatar
0 votes
0 answers
7
Merge Sort
Can anyone help me to understand this problem….??
Can anyone help me to understand this problem….??
User Avatar
0 votes
1 answer
8
Self Doubt
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?
User Avatar
2 votes
1 answer
9
Optimal Merge Pattern
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
User Avatar
0 votes
2 answers
10
Self doubt
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A. 66 B. 39 C. 15 D. 33
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A.66 B.39 C.15 D.33
User Avatar
2 votes
4 answers
11
Comparisons for merging four arrays
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst case using an efficient algorithm are ____.
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst ca...
User Avatar
2 votes
2 answers
14
Optimal Merge Pattern,similar to http://gateoverflow.in/1997/gate2014-2-38
To merge 2 files of size m and n it takes m + n time What will be the optimal time Complexity to merge the files of size 10, 15, 40, 70, 75 and 80?
To merge 2 files of size m and n it takes m + n time What will be the optimal time Complexity to merge the files of size 10, 15, 40, 70, 75 and 80?
User Avatar
0 votes
2 answers
16
A average number of comparison performed by the merge sort algorithm ,In Merging two sorted lists of length 2 is
If I have two lists of length 2 then no of comparisons in the worst case would be 2 only , since If I have say 10,20 in list A and 5,7 in list B so then on merging 10 is ...
User Avatar
0 votes
0 answers
17
Testbook
Can anyone clarify hy they are getting 269 and and I am getting 258?
Can anyone clarify hy they are getting 269 and and I am getting 258?
User Avatar
0 votes
0 answers
18
testbook Algorithm
How?
How?
User Avatar
0 votes
1 answer
19
Ace Test Series
User Avatar
Page: