递归版冒泡排序

#include<iostream>
#include<vector>
using namespace std;
class solution
{
public:
void bubble_sort(vector<int>& arr,int R)
{
if (R>0)
{
for (int i = 0; i < R; i++)
{
if (arr[i] > arr[i + 1])
{
int temp;
temp = arr[i];
arr[i] = arr[i + 1];
arr[i+1] = temp;
}
}
R--;
bubble_sort(arr, R);
}
if (R==0)
{
return;
}
}
};
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;
    s.bubble_sort(arr,arr.size()-1);
for (int i = 0; i < arr.size(); i++)
{
cout << arr[i]<<' ';
}
return 0;
}