程序猿猿猿

摘要： void merge(int *A,int p,int q,int r){//归并排序 合并数组部分int *temp1 = new int[q-p+1];int *temp2 = new int[r-q+1];for(int i = 0;itemp2[flag2]){A[m+p] = temp2[flag2];flag2++;}else if(temp1[flag1]<=temp2[flag2]){A[m+p] = temp1[flag1];flag1++;}}}delete []temp1;delete []temp2;}void merge_sort(int *A,int p,in 阅读全文