BUBBLE SORT..........IT'S IMPORTANT

KEY POINTS:

           IN THIS SORTING WE WILL CHECK AND SORT  TWO ADJACENT ELEMENTS AT A TIME

#include<iostream>
using namespace std;
int main()
{

int a[50],i,j,n,min,temp;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=n-2;i>=0;i--)
{
for(j=0;j<=i;j++)
{
if(a[j+1]<a[j])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}

}

}
for(i=0;i<n;i++)
{
cout<<a[i]<<endl<<endl;
}

}