排序算法 [draft]
冒泡排序 #include <bits/stdc++.h> using namespace std; void bubblesort(vector<int>& nums){ int n = nums.size(); for(int i = n - 1;i > 0;i--){ for(int j = 0;j < i;j++){ if(nums[j] > nums[j+1]) swap(nums[j], nums[j+1]); } } } int main(){ vector<int> nums(10); srand(unsigned(time(0))); // srand((unsigned)time(NULL)) 也可以 for(int i = 0;i < 10;i++){ nums[i] = rand() % 20; cout<<nums[i]<<" "; } cout<<endl; bubblesort(nums); for(auto x : nums) cout<<x<<" ";...