combinatorial algorithms, merging series

21 Views Asked by At

who can help to solve this combinatorial algorithms problemstrong text 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