归并(Merge)排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的,然后再把有序子序列合并为整体有序序列。
归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为2-路归并。
时间复杂度为O(nlogn),空间复杂度为 O(n),归并排序比较占用内存,但却效率高且是稳定的算法。
以下为递归实现的版本:
- #include<iostream>
- using namespace std;
- void Merge(int arr[],int low,int mid,int high)
- {
- int i=low,j=mid+1,k=0;
- int *temp=new(nothrow) int[high-low+1];
- if(!temp)
- {
- cout<<"ERROR!";
- return;
- }
- while(i<=mid && j<=high)
- {
- if(arr[i]<=arr[j])
- temp[k++]=arr[i++];
- else
- temp[k++]=arr[j++];
- }
- while(i<=mid)
- temp[k++]=arr[i++];
- while(j<=high)
- temp[k++]=arr[j++];
- for(i=low,k=0;i<=high;i++,k++)
- arr[i]=temp[k];
- delete []temp;
- }
- void MergeSort(int arr[],int low,int high)
- {
- if(low<high)
- {
- int mid=(low+high)/2;
- MergeSort(arr,low,mid);
- MergeSort(arr,mid+1,high);
- Merge(arr,low,mid,high);
- }
- }
- int main()
- {
- int x[]={0,5,-2,1,-8,7,6,-3};
- MergeSort(x,0,7);
- for(int i=0;i<8;i++)
- cout<<x[i]<<" ";
- return 0;
- }
参考 http://www.cnblogs.com/hackerain/archive/2011/01/07/2130424.html
非递归实现版本:
Merge函数和上面递归实现是完全一样的,MergeSort形参改成了待排序数组和数组大小。
- #include<iostream>
- using namespace std;
- void Merge(int arr[],int low,int mid,int high)
- {
- int i=low,j=mid+1,k=0;
- int *temp=new(nothrow) int[high-low+1];
- while(i<=mid&&j<=high)
- {
- if(arr[i]<=arr[j])
- temp[k++]=arr[i++];
- else
- temp[k++]=arr[j++];
- }
- while(i<=mid) temp[k++]=arr[i++];
- while(j<=high) temp[k++]=arr[j++];
- for(i=low,k=0;i<=high;i++,k++)
- arr[i]=temp[k];
- delete []temp;
- }
-
- void MergeSort(int arr[],int n)
- {
-
-
-
-
-
-
-
-
-
- int size=1,low,mid,high;
- while(size<=n-1)
- {
- low=0;
- while(low+size<=n-1)
- {
- mid=low+size-1;
- high=mid+size;
- if(high>n-1)
- high=n-1;
- Merge(arr,low,mid,high);
- cout<<"low:"<<low<<" mid:"<<mid<<" high:"<<high<<endl;
- low=high+1;
- }
- size*=2;
- }
- }
- int main()
- {
- int x[]={4,-5,0,3,-1,12,9,-7,8,-4,11};
- MergeSort(x, 11);
- for(int i=0;i<11;i++)
- cout<<x[i]<<" ";
- return 0;
- }