Bubble Sort in Data Structure

       ⇰  BUBBLE SORT :- 

The bubble sorting technique is very simple sorting technique. However this technique is not efficient in comparision to other sorting techniques but for smaller list this technique works fine. 
This sorting technique is comparison-based in which each pair of adjacent elements is compared and the elements are swapped if they are not in the desired order . Its worst case complexity is of Ο(n ^2) where n is the number of items in the list.
    Suppose we want to sort the elements of a list in ascending order, the bubble sort loops through the element in the list and compares the adjecent element and moves the smaller element to the the top of the list.

EXAMPLE :-

Let us take a unsorted list :-
    4 3 5 2 1

 ⇰  ALGORITHM OF BUBBLE SORT :-

Variable used :- list= array of element, n= number of element in the list.
I, J, temp = local variable.


Step1 :- Initialize
              I =1

Step2 :- Repeat through step5 
                while  (I < n) 

Step3 :-  Initialize
               J =1

Step4 :- Repeat through step5 
                while ( J < n-1)

Step5 :- If  list[ J ] > list[ J +1]  then :-
               i> temp = list[J]
              ii> list[J] = list[ J+1]
             iii> list[ J+1] = temp

Step6 :- Exit



⇰  PROGRAM OF BUBBLE SORT IN 'C' :-

# include <stdio.h>
# include <conio.h>

void main()

{

    int  i, j, temp, no[5];

 printf("Enter Values of array for sorting:- ");

for (i = 0 ; i < 5 ; i++)

{

  scanf ( " %d " ,& no[i] );

}

for (i = 0 ; i < 5 ; i++)

 {
     for(j=0 ; j<5-1-i ; j++)
      {
           if ( no[ j ] > no[ j +1] )
             {
               temp = no[ j ];
               no[ j ] = no[ j +1];
               no[ j +1] = temp;
              }
       }

 }

printf(" \n Sorted value :- ");

for ( i=0 ; i < 5; i++)

 {

    printf(" \n %d" , no[ i ] );

}

getch();

}

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above.