Bubble Sorting (Ascending)

Bubble is one of the simplest sorting algorithms which sorts by repeatedly comparing and swapping adjacent elements. Being simple it is not suitable for large data sets. This algorithm is also known as Brute Force sorting algorithm.

Here we used Bubble Sort to sort an array in Ascending order.

C
#include <stdio.h>
int main()
{
    int size=0,temp=0;
    printf("Enter array size: ");
    scanf("%d",&size);
    int ar[size];
    printf("Enter array elements:-\n");
    for(int i=0;i<size;i++)
    {
        scanf("%d",&ar[i]);
    }
    for(int i=0;i<size-1;i++)
    {
        for(int j=0;j<size-i-1;j++)
        {
            if(ar[j]>ar[j+1])
            {
                temp=ar[j];
                ar[j]=ar[j+1];
                ar[j+1]=temp;
            }
        }
    }
    printf("Sorted array:-");
    for(int i=0;i<size;i++)
    {
        printf("%d ",ar[i]);
    }
    return 0;
}
C