1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
| #include<iostream> #include<algorithm>
using namespace std;
template<class T> void merge(T *list, T *mergeList, const int left, const int mid, const int right) { int i = left; int j = mid+1; int k = 0; while(i <= mid && j <= right) { if(list[i] <= list[j]) { mergeList[k] = list[i]; i++; k++; } else { mergeList[k] = list[j]; j++; k++; } } while(i <= mid) { mergeList[k] = list[i]; i++; k++; } while(j <= right) { mergeList[k] = list[j]; j++; k++; } for(int m=0; m<k; m++) { list[left + m] = mergeList[m]; } }
template<class T> void mergeSort(T *list, T *mergeList, const int left, const int right) { if(left < right) { int mid = (left + right) / 2; mergeSort(list, mergeList, left, mid); mergeSort(list, mergeList, mid+1, right); merge(list, mergeList, left, mid, right); } }
int main() { int a[] = {23,47,81,95,7,14,39,55,62,74}; int b[10] = {0}; mergeSort(a, b, 0, 9); for(int i=0; i<10; i++) { cout<<a[i]<<" "; } return 0; }
|