combinatorial algorithms: Let M(n,m) denote the complexity of the best algorithm for merging of a1<..<an, b1<..<bm series. Prove that M(3,6) <= 7.

[fantastic]

Let M(n,m) denote the complexity of the best algorithm for merging of a1<..<an, b1<..<bm series. Prove that M(3,6) <= 7.How solve this problem who can explain

 

[khansaheb]

Let M(n,m) denote the complexity of the best algorithm for merging of a1<..<an, b1<..<bm series. Prove that M(3,6) <= 7.How solve this problem who can explain

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

READ BEFORE POSTING​

Please share your work/thoughts about this problem

 

[MaxWong]

How do you define the complexity of an algorithm? I usually use big-O notation for time complexity, but it seems to be not the case here.

To be more explanatory, what is the "unit" of 7? Lines of code? Number of O(1) operations? The question is unclear.