Data Structure: C++ Programming of Bubble Sort

#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[100],i,n,p,j,temp;

cout<<"\n------------ BUBBLE SORT ------------ \n\n";

cout<<"Enter No. of Elements : ";
cin>>n;

cout<<"\nEnter Elements : \n";
for(i=0;i<n;i++)
{
cin>>a[i];
}


for(p=0;p<n-1;p++)             // Loop for Pass
{

for(j=0;j<n-p;j++)             // The element will be compared with n-p elements.
                               // If we have 4 elements in the array, then for the first pass (p=0), the element will be
                               // compared with 3 elements i.e (n-p=3-0=3)
{
if(a[j]>a[j+1])
{
temp=a[j];                      // Interchange Values
a[j]=a[j+1];
a[j+1]=temp;
}
}

}

cout<<"\nAfter Sorting : \n";
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}

getch();
}