摘要：
void merge( vector<int> &v1, int low, int mid, int high ) { vector<int> v2(L); int i = low, j = mid + 1, k = low; while ( i <= mid && j <= high ) { if ( v1[i] <= v1[j] ) { v2[k++] = v1[i++]; } else { v2[k++] = v1[j++]; } } while ( i <= mid ) ... 阅读全文
