qq_43965149的博客

快速排序找 topkint quickSort(vector<int>&arr, int left, int right, int k){ int i = left, j = right; //随机选择基准值 int ran = (rand() % (right - left + 1)) + left; swap(arr[ran], arr[left]); //基准值即arr[left] while (i < j) { while (i < j&a

排序（个人向理解）冒泡//冒泡排序//时复O(n^2) 空复O(1)void bubble_sort(vector<int>&nums){ for (int i = 0; i < nums.size(); ++i) { //cout << i << " " << nums.size() - 1 - i << endl; for (int j = 0; j < nums.size()-1-i; ++j)//