006.归并排序

       以下内容参考自Wikipedia

#include<iostream>
using namespace std;
void merge_sort_recursive(int arr[], int reg[], int start, int end)
{
if (start >= end)
return;
int len = end - start, mid = (len >> 1) + start;
int start1 = start, end1 = mid;
int start2 = mid + 1, end2 = end;
merge_sort_recursive(arr, reg, start1, end1);
merge_sort_recursive(arr, reg, start2, end2);
int k = start;
while (start1 <= end1 && start2 <= end2)
reg[k++] = arr[start1] < arr[start2] ? arr[start1++] : arr[start2++];
while (start1 <= end1)
reg[k++] = arr[start1++];
while (start2 <= end2)
reg[k++] = arr[start2++];
for (k = start; k <= end; k++)
arr[k] = reg[k];
}
void merge_sort(int arr[],int len)
{
int* reg = new int[len];
merge_sort_recursive(arr, reg, 0, len - 1);
}
int main()
{
int a[] = { 1,2,3,55,67,3456,42,1,234,22 };
merge_sort(a, 10);
for (int i = 0; i < 10; i++)
{
cout << a[i] << " ";
}
system("pause");
return 0;
}

最后

以上就是可靠服饰为你收集整理的006.归并排序的全部内容，希望文章能够帮你解决006.归并排序所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。