先排序,在逐个比较插入,最坏时间复杂度为表1长度+表2长度-1
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
typedef struct List
{
int* elem;//存储空间地址
int length;//表长
}List;
void sortList(List* p, int length)
{
for (int i = 0; i < length - 1; i++)
{
for (int j = 0; j < length - 1 - i; j++)
{
int temp;
if (p->elem[j] > p->elem[j + 1])
{
temp = p->elem[j];
p->elem[j] = p->elem[j + 1];
p->elem[j + 1] = temp;
}
}
}
}
int main()
{
int l1 = 0;
int l2 = 0;
//初始化表一
printf("输入表1的长度:");
scanf("%d", &l1);
List list1;
list1.elem = (int*)malloc(l1 * sizeof(int));
printf("输入元素:\n");
for (int i = 0; i < l1; i++)
{
scanf("%d", &(list1.elem[i]));
}
//初始化表二
printf("输入表2的长度:");
scanf("%d", &l2);
List list2;
list2.elem = (int*)malloc(l2 * sizeof(int));
printf("输入元素:\n");
for (int i = 0; i < l2; i++)
{
scanf("%d", &(list2.elem[i]));
}
//排序
sortList(&list1, l1);
sortList(&list2, l2);
//归并
List list3;
list3.length = l1 + l2;
list3.elem = (int*)malloc(list3.length * sizeof(int));
if (!list3.elem) {
exit(0);
}
//建立表一和表二指向开头和末尾的指针
int* list1_last = list1.elem + list1.length - 1;
int* list2_last = list2.elem + list2.length - 1;
int* list1_start = list1.elem;
int* list2_start = list2.elem;
int* list3_start = list3.elem;
//归并
while (list1_start <= list1_last && list2_start <= list2_last)
{
if (*(list1_start) <= *(list2_start))
{
*(list3_start++) = *(list1_start++);
}
else
{
*(list3_start++) = *(list2_start++);
}
}
while (list1_start <= list1_last)//插入表一剩余元素
{
*(list3_start++) = *(list1_start++);
}
while (list2_start <= list2_last)//插入表2剩余元素
{
*(list3_start++) = *(list2_start++);
}
//打印
for (int i = 0; i < list3.length; i++)
{
printf("%d ", *(list3.elem++));
}
return 0;
}