【排序（ACM模式）】冒泡、选择、插入、快排

1. 冒泡

#include <iostream>
#include <vector>

using namespace std;

void print(vector<int>&nums)
{
   
	for (auto i : nums)
		cout << i << " ";
	cout << endl;
}

void bubblesort(vector<int>&nums, int n)
{
   
	for (int i = 0; i < n; i++)
	{
   
		for (int j = 0; j < n - 1 - i; j++)
		{
   
			if (nums[j] > nums[j + 1])
				swap(nums[j+1],nums[j]);
		}
	}
}

int main()
{
   
	int n;
	cin >> n;
	vector<int> nums;  //vector<int> nums(n);写成这样会出错
	int temp;
	for (int i = 0; i < n; i++)
	{
   
		cin >> temp;
		nums.push_back