Sorting an Array using Bubble Sort

In this article we will see how an array can be sorted using Bubble Sort Technique.
Sorting, as you know, is the method of arranging the elements of an array in
an order (ascending or descending).

The basic idea behind bubble sort method of sorting is to keep on comparing
adjoining elements of the array from the first until the last and interchanging
them if they are not in proper order. The whole sequence is repeated several
times when the array becomes sorted.

Bubble Sort Algorithm

Suppose,

• 
  

  The array (to be sorted) to be AR[SIZE] having SIZE number of elements.

  
  


• 
  

  L is the index number of the lower element. We take it to be 0, since the
  whole array has to be sorted.

  
  


• 
  

  U is the index number of the upper (last) element. It will be (SIZE-1).

  
  

Here is the algorithm of sorting the array using bubble sort

1. 
   

   FOR I = L TO U

   
   


2. 
   

   FOR J = L TO (U-1)

   
   


3. 
   

   IF AR[J] > AR[JA1] THEN
          temp = AR[J]
          AR[J] = AR[J+1]

   
   


4. 
   

   END OF INNER LOOP

   
   


5. 
   

   END OF OUTER LOOP

   
   

Now that you know the algorithm, lets have a look at a simple c++ program to
sort an array using bubble sort:

  // Example Program in C++
  // to sort an array
  // using bubble sort

  #include<iostream.h>

  void main(void)
  {
   int temp, i, j;
   int ar[10];

   cout<<"enter elements of array:\n";
   for(i=0; i<10; i++)
     cin>>ar[i];

   // sorting is done here
   for(i=0;i<10;i++)
     for(j=0; j<(10-1); j++)
       if (ar[j]>ar[j+1])
         {
          temp=ar[j];
          ar[j]=ar[j+1];
          ar[j+1]=temp;
         }
   // till here
  
   for(i=0; i<10; i++)
     cout<<endl<<ar[i];
  
   cout<<endl;
  }

Good-Bye guys!

Do check back for updates!

Related Articles:

• Sorting
  an array using Selection Sort