charles666_zq的博客

#include <iostream> #include <vector> #include <algorithm> using namespace std; void shuffle(vector<int> &nums) { int n = nums.size(); for (int i = 0; i < n; i++) { swap(nums[i], nums[rand() % (n - i) + i]); } return

#include <iostream> using namespace std; void merge(int a[], int lo, int mid, int hi) { int* b = new int[mid - lo]; for (int i = 0; i < mid - lo; ++i) b[i] = a[lo + i]; for (int i = lo,j = 0, k = mid; i < hi; ++i) { if (k > hi - 1 || (