参考：[http://www.crazycoder.cn/]合并排序也用了分治的策略，不过划分只是从中间做，而merge复杂一些．

参考：[http://www.crazycoder.cn/]

参考：[http://www.crazycoder.cn/]#include <stdlib.h>
#include <stdio.h>
#include <time.h>

#define MAX_LENGTH 100

/*Show usage*/
void usage(char * prog)
{
printf(\"%s Usage:\\n\", prog);
printf(\"%s <length of 1st list> <length of 2nd list>(Both should be less than 100)>\\n\", prog);
}

/*Generate and initialize the list*/
int * generate_list(int count)
{
int i;
int * list;

list = (int *)malloc(count*sizeof(int));
if(list == NULL)
{
perror(\"malloc\");
return NULL;
}

/*Initialize the list with integers less than 100*/
srandom((unsigned int)time(NULL));
for (i = 0; i < count ; i ++)
list[i] = random()%100;

return list;
}

/*Show the list*/
void show_list(int * list, int length)
{
int i;
for(i = 0; i < length; i ++)
printf(\"%d \", list[i]);

printf(\"\\n\");
}