Bubble Sort Algorithm

//bubble sort algorithm in c++
#include<bits/stdc++.h>
using namespace std;
void bubble_sort(int arr[],int n)
{
    int i,j;
    for(i=1;i<n;i++)
    {
        for(j=0;j<n-i;j++)
        {
            if(arr[j]>arr[j+1])
            {
                swap(arr[j],arr[j+1]); //swap is an inbuilt function
            }
        }
    }
    //time complexity is O(n^2)
}
int main()
{
    int n,i;
    cout<<"Enter the number of elements of the array"<<endl;
    cin>>n;
    int arr[n];
    for(i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    bubble_sort(arr,n);
    cout<<"Now printting the elements of the sorted array"<<endl;
    for(int p:arr)
    {
        cout<<p<<" ";
    }
    return 0;
}