1.【概念引入】
归并排序(MERGE-SORT)是建立在归并操作上的一种有效的排序算法,该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为二路归并。具体过程如下图所示:
2.【代码示例】
mergesort.h
void merge(int* a, int left, int right, int mid)
{
int l = left;
int r = mid + 1;
int len = mid - left + 1;
int* tmp = new int[len](); //申请合并的数组,该数组不用开太大,没用
for (int i = 0; i < len; ++i)
{
tmp[i] = a[left++];
}
int i = 0;
while (i < len && r < right+1)
{
if (tmp[i]>a[r])
{
a[l++] = a[r++];
}
else
{
a[l++] = tmp[i++];
}
}
while (r<right+1)
{
a[l++] = a[r++];
}
while (i < len)
{
a[l++] = tmp[i++];
}
delete tmp;
}
void merge_sort(int a[], int left, int right)
{
if (left >= right)
{
return;
}
int mid = ((right - left) >> 1) + left; //二分
merge_sort(a, left, mid);
merge_sort(a, mid + 1, right);
merge(a, left, right, mid);
}
void mergeSort(int arr[], int len)
{
merge_sort(arr, 0, len-1);
}
main.cpp
int main() //归并排序
{
int arr[] = {5, 2,2, 8, 3, 4, 6, 1,-1,1};
int len = sizeof(arr) / sizeof(arr[0]);
mergeSort(arr, len);
for (int i = 0; i < len; i++)
{
cout << arr[i] << " ";
}
cout << endl;
return 0;
}