归并排序C++

最新推荐文章于 2024-10-02 08:00:00 发布

star marks

最新推荐文章于 2024-10-02 08:00:00 发布

阅读量64

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/qq_58859800/article/details/120406775

版权

把两个升序排列的整型数组合并为一个升序数组。

#include<iostream>

using namespace std;

int main()

{

 int r, k, t;

 const int N = 10;

 int i = 0, j = 0;

 int a[N] = { 3,8,15,19,22,25,30,33,38,40 };//2个升序数组

 int b[N] = { 1,9,14,23,24,28,35,39,42,45 };

 int s[N + N + 1];

 for (k = 0; k < N; k++)

 {

 s[k] = a[i];

 i++;

 }

 for (k = N; k < N + N; k++)

 {

 s[k] = b[j];

 j++;

 }

 for (k = 0; k < N + N; k++)

 for (r = 0; r < N + N; r++)

 if (s[r + 1] < s[r])

 {

 t = s[r + 1];

 s[r + 1] = s[r];

 s[r] = t;

 }

 for (r = 1; r <= N + N; r++)

 cout << s[r] << ",";

 cout << endl;

 return 0;

}