c++ 冒泡排序

#include <iostream>
#include <vector>
using namespace std;void bubble_sort(std::vector<int> &nums)
{std::cout<<"bubble_sort"<<std::endl;int lenght = nums.size();for(int i= 1;i<lenght;i++){for(int j= 0;j<lenght - i;j++){if(nums[j]>nums[j+1]){int tmp = nums[j+1];nums[j+1] = nums[j];nums[j] = tmp;}}std::cout<<"i="<<i<<"\t";for(auto num:nums){std::cout<<num<<" ";}std::cout<<std::endl;}
}int main(int argc,char**agrv)
{std::vector<int> nums = {5,8,3,4,6,7,2};bubble_sort(nums);for(auto num:nums){std::cout<<num<<" ";}std::cout<<std::endl;}