#include <stdio.h>
#define MAX_SIZE 100
int list1[MAX_SIZE], list2[MAX_SIZE];
int size1, size2;
void mergeAndSort() {
int i = 0, j = 0, k = 0;
int mergedList[MAX_SIZE];
while (i < size1 && j < size2) {
if (list1[i] < list2[j]) {
mergedList[k++] = list1[i++];
用c语言数据结构的方式写一个程序:对于两个无序的顺序表,合并它们并且按从小到大的顺序排序...
![](https://img-home.csdnimg.cn/images/20240711042549.png)