WaitingfoDreams的博客

//分为{<v}部分和{>=v}部分template<typename T>int __partition(T arr[], int l, int r){ //优化一：采用随机数，避免近乎有序的数组使得快排递归树平衡度过低而退化为O（n^2） swap(arr[l], arr[rand() % (r - l + 1) + l]); T v = arr[l]; //arr[l+1...j] < v;arr[j+1...i] > v int j = l;

template<typename T>void __merge(T arr[], int l, int mid, int r){ T *aux = new T[r - l + 1]; for (int i = l; i <= r; i++) aux[i - l] = arr[i]; int i = l, j = mid + 1; for (int k = l; k <= r; k++) { if (i > mid) { arr[k] = aux[j