retagged by
1,472 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

4.0k
views
1 answers
2 votes
VIKAS TIWARI asked Dec 13, 2017
4,044 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.
634
views
2 answers
0 votes
25.6k
views
8 answers
86 votes
go_editor asked Sep 28, 2014
25,605 views
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by ... that will be needed in the worst case by the optimal algorithm for doing this is ____.
2.3k
views
1 answers
5 votes
Shashank Chavan asked Dec 15, 2015
2,255 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>