标签：ceph ddp fir 排序算法 jms 3.5 col www. bst
| #include<iostream> using namespace std; //归并排序,先数组细分为单个，在合并 int mergeArr(int* arr,int first,int mid,int last); int mergeSort(int* arr,int first,int last); //递归实现 int metgeSortIterator(int* arr,int first,int last); //非递归实现 void swap(int& elem1,int& elem2); void test(); void printArr(int* arr,int length); int mergeArr(int* arr,int first,int mid,int last) { if(NULL==arr||first>last||first>mid||mid>last||first<0||mid<0||last<0) return -1; int len = last - first +1; int* tmpArr = new int[len](); int firIdx = first,lasIdx = mid + 1; int idx = 0; while(firIdx<=mid&&lasIdx<=last) { if(arr[firIdx]<arr[lasIdx]) tmpArr[idx++] = arr[firIdx++]; else tmpArr[idx++] = arr[lasIdx++]; } while(firIdx<=mid) tmpArr[idx++] = arr[firIdx++]; while(lasIdx<=last) tmpArr[idx++] = arr[lasIdx++]; for(int iidx=first,idx=0;iidx<=last;++iidx) arr[iidx] = tmpArr[idx++]; delete []tmpArr; return 0; } int mergeSort(int* arr,int first,int last) { if(NULL==arr||first<0||last<0||first>last) return -1; int mid = (first + last)/2; if(first<last) //划分为只有一个元素 { mergeSort(arr,first,mid); mergeSort(arr,mid+1,last); } //合并 mergeArr(arr,first,mid,last); return 0; } int metgeSortIterator(int* arr,int first,int last) { if(NULL==arr||first<0||last<0||first>last) return -1; //非递归，直接合并 for(int idx=1;idx<=last;idx*=2) //都是两两合并，所以乘以2，最初从1开始，表示数组都划分为1的单个数组 { int firstIdx = 0; while(firstIdx+idx<=last) { int mid = firstIdx + idx -1; //last有特殊情况，比如数组奇数个，最后会剩下一个元素 int lastIdx = mid + idx <= last ? mid + idx : last; mergeArr(arr,firstIdx,mid,lastIdx); firstIdx = lastIdx + 1; //开始合并下一个子序列 } } return 0; } | void printArr(int* arr,int length) { if(NULL==arr||length<=0) return ; for(int idx=0;idx!=length;++idx) { cout<<arr[idx]<<" "; } cout<<endl; } void test() { int arr[] = {6,5,3,1,8,7,2,4}; printArr(arr,8); mergeSort(arr,0,7); /*metgeSortIterator(arr,0,7);*/ printArr(arr,8); cout<<endl; int arr1[] = {1,2,0,-1,5,6,8,3}; printArr(arr1,8); mergeSort(arr1,0,7); /*metgeSortIterator(arr1,0,7);*/ printArr(arr1,8); cout<<endl; int arr2[] = {2,2,2,2}; printArr(arr2,4); mergeSort(arr2,0,3); //metgeSortIterator(arr2,0,3); printArr(arr2,4); cout<<endl; int arr3[] = {2,4,1}; printArr(arr3,3); mergeSort(arr3,0,2); /*metgeSortIterator(arr3,0,2);*/ printArr(arr3,3); cout<<endl; int arr5[] = {1,2,3,4,5,6,7,8}; printArr(arr5,8); mergeSort(arr5,0,7); /*metgeSortIterator(arr5,0,7);*/ printArr(arr5,8); cout<<endl; int* arr6 = NULL; printArr(arr6,4); mergeSort(arr6,0,3); /*metgeSortIterator(arr6,0,3);*/ printArr(arr6,4); cout<<endl; } int main() { test(); system("pause"); }  |
标签：ceph ddp fir 排序算法 jms 3.5 col www. bst
原文地址：https://www.cnblogs.com/meihao1203/p/9204287.html
