摘要:
归并排序(递归)void MergeSort(int *A, int n){ if(n == 1){ return ; } int *C = new int[n]; int l1 = n/2; int l2 = n-l1; MergeSort(A, l1); MergeSort(&A[l1], l2); for(int i = 0, j = l1, k = 0; k < n;){ while(i!=l1 && j != n){ if(A[i]<A[j]){ C[k] = A[i]; k++; i++; }else{ ... 阅读全文
posted @ 2013-03-12 15:50
碎雨
阅读(153)
评论(0)
推荐(0)