Bubble sort is a beginners sorting program, it is most learned, but not most used widely due to its time complexity.

Bubble sort time complexity is `O(n`

^{2})

## Code for Bubble Sort in C

# include

int main()

{

int a[10],i,j,temp,n;

printf(“\n Enter the max no.of Elements to Sort: \n”);

scanf(“%d”,&n);

printf(“\n Enter the Elements : \n”);

for(i=0; ia[j])

{

temp=a[i];

a[i]=a[j];

a[j]=temp;

}

}

for(i=0; i<n; i++)

{

printf(“%d\t”,a[i]);

}

return 0;

}

## Output for bubble sort program:

Enter the max no.of Elements to Sort: 5 Enter the Elements : 45 21 89 78 99 21 45 78 89 99