Bubble Sort Algorithm in C

[1486 views]


In this article, we will see very Simple implementation of Bubble Sort Algorithm in C

Simple Bubble Sort Algorithm implementation in C programming language
#include <stdio.h> int main() { int a[]={1,5,3,2,4}; int n=sizeof(a)/sizeof(int); for(int i=0;i<n;i++) { for(int j=0;j<n-1;j++) { if(a[j]>a[j+1]) { int temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } } printf("after sorting \n"); for(int i=0;i<n;i++) { printf("%d ",a[i]); } return 0; }

Why It is called bubble sort?

The bubble sort gets its name because elements tend to move up into the correct order like bubbles rising to the surface.

        

Struggling to Understand Algorithm and Flowchart? Try our Notes



Want to Test Your Knowledge on Algorithm and Flowchart?



Comments



Recommended Deals End in



Search
Online Games
Play 2048 Game Online and Relax.
Play 2048 Game Online

Search Tags

    Simple Bubble Sort Algorithm in C

    C program for Bubble Sort

    C program for Sinking Sort