Bubble Sort in C

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(n2)

Check the detailed explanation about Time complexities.

Quick sort and Merge sort are efficient sorting algorithms for real time implementation.

Check the Video for Bubble Sort procedure:

The following program is Bubble sort written in C.

Code for Bubble Sort in C

#include<stdio.h>
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; i<n; i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0; i<n; i++)
        for(j=i+1; j<n; j++)
        {
            if(a[i]>a[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