VS 2017 归并排序代码
思路是二分,然后组合。(对数组分段处理。)
#include "pch.h"
#include <iostream>
#include <vector>
using namespace std;
void mergesort(vector<int>&array, int left, int right);
void merge(vector<int>&array, int left, int right, int mid);
int main()
{
vector<int> data;
for (int i = 10; i>0 ; i--)
data.push_back(i);
mergesort(data, 0, 9);
return 0;
}
void mergesort(vector<int>&array, int left, int right)
{
if (left >= right)
return ;
int mid = left - (left-right) / 2;
mergesort(array, left, mid);
mergesort(array, mid + 1, right);
merge(array, left,right,mid);
}
void merge(vector<int>&array, int left, int right, int mid)
{
vector<int> temp;
int i = left;
int j = mid + 1;
while (i <= mid && j <= right)
{
if (array[i] <= array[j])
temp.push_back(array[i++]);
else
temp.push_back(array[j++]);
}
while (i <= mid)
temp.push_back(array[i++]);
while(j<=right)
temp.push_back(array[j++]);
int k = temp.size();
for (int i =0; i <temp.size(); i++)
array[left++] = temp[i];
}
1、时间复杂度:O(nlogn) 2、空间复杂度:O(n) 3、稳定排序 4、非原地排序