Bubble Sort Method

//Program to Sort data in Ascending order using Bubble Sort Method

#include< stdio.h>

#include< conio.h>


void main()
{
//variable declaration
int a[50],i,j,n,temp;
clrscr();
printf("Enter Total Number of Elements :: ");
scanf("%d",&n);
printf("\n Enter Elements :: ");


//Input array element
for(i=0;i< n;i=i+1)
{
scanf("%d",&a[i]);
}


//Print Unsorted List
printf("\n Unsorted List :: \n");
for(i=0;i < n;i=i+1)
{
printf("\t%d",a[i]);
}


//Sort data in ascending order
for(i=0;i < n;i++)
{
for(j=0;j < n-i+1;j=j+1)
{
if (a[j] > a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}


//Print Sorted List
printf("\n Sorted List :: \n");
for(i=0;i < n;i=i+1)
{
printf("\t%d",a[i]);
}
getch();
}