冒泡排序

#include<iostream>
#include<vector>
using namespace std;
class solution
{
public:
vector<int> bubble_sort(vector<int>& arr)
{
int arr_len=arr.size();
for (int i = 0; i < arr_len-1; i++)
{
for (int j = 0; j<arr_len - i-1; j++)
{
if (arr[j]>arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
return arr;
}
};
int main()
{
int n;
vector<int> arr;
cin >> n;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
arr.push_back(temp);
}
solution s;
vector<int> re;
re = s.bubble_sort(arr);
for (int i = 0; i < re.size(); i++)
{
cout << re[i]<<' ';
}
return 0;
}