Bubble sort is also known as sinking sort. This algorithm compares each pair of adjacent items and swaps them if they are in the wrong order, and this same process goes on until no swaps are needed. In the following program we are implementing bubble sort in C language. In this program user would be asked to enter the number of elements along with the element values and then the program would sort them in ascending order by using bubble sorting algorithm logic.

#### Implementing bubble sort algorithm in a C program

/* Implementing Bubble sort in a C Program * Written by: Chaitanya. */ #include<stdio.h> int main(){ int count, temp, i, j, number[30]; printf("How many numbers are u going to enter?: "); scanf("%d",&count); printf("Enter %d numbers: ",count); for(i=0;i<count;i++) scanf("%d",&number[i]); /* This is the main logic of bubble sort algorithm */ for(i=count-2;i>=0;i--){ for(j=0;j<=i;j++){ if(number[j]>number[j+1]){ temp=number[j]; number[j]=number[j+1]; number[j+1]=temp; } } } printf("Sorted elements: "); for(i=0;i<count;i++) printf(" %d",number[i]); return 0; }

**Output:**