Bubblesortrecursion what is error in the code

#1

#include
using namespace std;
void bubble_sort_rec(int a[] , int j , int n)
{
if(n==1)
{
return;
}
if(j == n-1)
{
return bubble_sort_rec(a,0,n-1);
}
if(a[j] > a[j+1])
{
swap(a[j],a[j+1]);
}
bubble_sort_rec(a,j+1,n);
return;
}
int main()
{
int a[] = {8,7,9,0,4};
int n = 5;
cout<< bubble_sort_rec(a,0,n);
return 0;
}

#2

@dhruvtrehan45 here why return and cout function . here corrected code
#include<bits/stdc++.h>
using namespace std;
void bubble_sort_rec(int a[] , int j , int n)
{
if(n==1)
{
return;
}
if(j == n-1)
{
bubble_sort_rec(a,0,n-1);
return;
}
if(a[j] > a[j+1])
{
swap(a[j],a[j+1]);
}
bubble_sort_rec(a,j+1,n);
return;
}
int main()
{
int a[] = {8,7,9,0,4};
int n = 5;
bubble_sort_rec(a,0,n);
cout<<a[0]<<a[1]<<a[2]<<a[3]<<a[4];
return 0;
}
if cleared dont forget to mark resolved :smiley: