归并排序//归并merge,需要一个辅助数组 void merge(vector<int>&arr, int start, int mid, int end, vector<int>&temp) { int istart = start; int iend = mid; int jstart = mid + 1; int jend = end; while (istart <=iend&& jstart<=jend) { if (arr[istart] > arr[jstart]) { temp.push_back(ar...