retagged by
1,335 views
2 votes
2 votes
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?
retagged by

2 Answers

Answer:

Related questions

2 votes
2 votes
1 answer
1
VIKAS TIWARI asked Dec 13, 2017
3,817 views
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.
0 votes
0 votes
2 answers
2
5 votes
5 votes
1 answer
3
Shashank Chavan asked Dec 15, 2015
2,125 views
In Optimal merge pattern when do we get more than one tree(Sub trees) when creating a merge pattern?Can you explain/draw optimal merge tree for n=7, <8,15,3,10,20,2,30>
0 votes
0 votes
2 answers
4
radha gogia asked Jul 31, 2015
11,498 views
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 ...