In this sorting method we compare in pair of two element if the element in first position is larger than the second element then we swap both of them. This sorting technique is easy to implement but time consuming. This method requires n time to sort the array.
Program:
#include<stdio.h>
#include<conio.h>
int main()
{
int i,j,a[5];
int temp,count=0;
printf("\n\n Enter any 5 element: ");
for(i=0;i<5;i++)
scanf("%d",&a[i]);
printf("\n\n Element before sorting : ");
for(i=0;i<5;i++)
printf(" %d ",a[i]);
for(i=1;i<5;i++)
{
for(j=0;j<5-i;j++)
{
printf("\n i=%d j=%d a[%d]=%d a[%d]=%d ",i,j,j,a[j],j+1,a[j+1]);
// Only to understand iteration
if(a[j]>a[j+1])
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
printf("\n\n");
}
printf("\n\n Element after sorting : ");
for(i=0;i<5;i++)
printf(" %d ",a[i]);
return 0;
}
