归并排序的时间复杂度:最好O(nlogn),平均O(nlogn),最坏O(nlogn)。归并排序是稳定的排序算法。
上code
#include <iostream>
using namespace std;
void merge(int a[],int L,int M,int R)
{
const int ls = M - L; //这里实际上是L---M,因为传进来的M是M+1
const int rs = R - M + 1; //M+1--R
int i=0, j=0, k=L;
int* left = new int[ls](); //左边数组
int* right = new int[rs](); //右边数组
for (int i = L; i < M; ++i)
{
left[i-L] = a[i];
}
for (int j = M; j <= R; ++j)
{
right[j-M] = a[j];
}
while (i < ls && j<rs) //合并
{
if (left[i] < right[j]) //升序<,降序>
{
a[k++] = left[i++];
}
else
{
a[k++] = right[j++];
}
}
while (i < ls) //如果还有剩下的元素,就把剩下的元素依次放到数组中
{
a[k++] = left[i++];
}
while (j < rs)
{
a[k++] = right[j++];
}
delete[] left; //释放内存
delete[] right; //释放内存
}
void merge_sort(int arr[], int L, int R)
{
if (L == R) //递归结束条件
{
return;
}
int mid = (L + R) / 2;
merge_sort(arr, L, mid); //分组
merge_sort(arr, mid + 1, R); //分组
merge(arr, L, mid + 1 , R); //合并,这里必须是mid + 1
}
int main()
{
int a[] = { 4,1,2,8,7,9,5,3,6,20,17 };
merge_sort(a, 0, 10);
for (int i = 0; i < 11; ++i)
{
cout << a[i] << ' ';
}
cout << endl;
return 0;
}