In this tutorial you will learn about the Bubble Sort Algorithm and its application with practical example.
In this tutorial, we will learn about the bubble sort algorithm and its implementation in C, C++, Java and Python.
Bubble Sort Algorithm is a simple sorting algorithm which sort a given set of n number of elements. In Bubble sort, each of the element is compared with its adjacent element and swapped if they are not in the intended order. It compares all elements one by one starting from the first element to sort them in the intended order.
Bubble Sort Program in C
In the following program we are implementing bubble sort algorithm in C language. In this program user will be asked to enter the number of elements and corresponding element values. Later in the program we would sort them in ascending order using this algorithm.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
#include<stdio.h> int main(){ int n, temp, i, j, nums[30]; printf("Enter number of elements: "); scanf("%d", &n); printf("Enter %d integer numbers\n", n); for(i=0;i<n;i++) scanf("%d",&nums[i]); for(i=n-2;i>=0;i--){ for(j=0;j<=i;j++){ if(nums[j]>nums[j+1]){ temp=nums[j]; nums[j]=nums[j+1]; nums[j+1]=temp; } } } printf("Elements after sorting: "); for(i=0;i<n;i++) printf(" %d",nums[i]); return 0; } |
Output:-
