#include <iostream>
#include <vector>
using namespace std;
void merge(vector<int>& a, int left, int mid, int right){
vector<int> temp;
int m = left, n = mid + 1;
while (m <= mid && n <= right){
a[m] < a[n] ? temp.push_back(a[m++]) : temp.push_back(a[n++]);
}
while (m <= mid){
temp.push_back(a[m++]);
}
while (n <= right){
temp.push_back(a[n++]);
}
for (int i = 0; i < temp.size(); ++i){
a[i + left] = temp[i];
}
}
void mergesort(vector<int>& a, int left, int right){
if (a.size() < 2)
return;
if (left < right){
int mid = (left + right) / 2;
mergesort(a, left, mid);
mergesort(a, mid + 1, right);
merge(a, left, mid, right);
}
}
void main(){
vector<int> arr = { 4, 6, 5, 2, 56, 4, 21, 2, 0, 56 };
for (auto i : arr){
cout << i << " ";
}
cout << endl;
mergesort(arr, 0, arr.size() - 1);
for (auto i : arr){
cout << i << " ";
}
cout << endl;
}
排序算法之归并排序c++实现
最新推荐文章于 2024-06-22 23:53:37 发布