摘要:
笔试题目见http://blog.csdn.net/hackbuteer1/article/details/8016173面试题目:(1) 给定m个数组,每个数组有n个元素,分别有序,要将其归并成一个有序的大数组,并计算时间复杂度。多路归并 T(m)=2*T(m/2)+O(m*n) => T(m)=mnlog(m)代码如下View Code 1 const int MaxM=100; 2 const int MaxN=100; 3 int temp1[(MaxM+1)*(MaxN+1)]; 4 int temp2[(MaxM+1)*(MaxN+1)]; 5 const int INFI= 阅读全文