- using namespace std;
- typedef struct
- {
- int data[100];
- int length;
- }SqList;
- void Merge(SqList L1,SqList L2,SqList &L3)
- {
- int i = 0,j = 0,k = 0;
- while (i < L1.length && j < L2.length)
- {
- if (L1.data[i] < L2.data[j])
- {
- L3.data[k] = L1.data[i];
- i++; k++;
- }
- else
- {
- L3.data[k] = L2.data[i];
- j++; k++;
- }
- }
- while (i < L1.length)
- {
- L3.data[k] = L1.data[i];
- i++; k++;
- }
- while (j < L2.length)
- {
- L3.data[k] = L2.data[j];
- j++; k++;
- }
- L3.length = k;
- }
-
有序表归并算法
最新推荐文章于 2021-12-31 14:37:37 发布