Program to illustrate the Bubble Sort

 # include <iostream.h>
 # include <conio.h>

 void bubble_sort(long [],int);


 main( )
    {
       clrscr( );

       const int array_size=10;

       long array[array_size]={0};

       cout<<\"\\n ******************************************************************************\"<<endl;
       cout<<\" ********************************  Bubble Sort  *******************************\"<<endl;
       cout<<\" ******************************************************************************\"<<endl;

       cout<<\"\\n * Array size = 10\"<<endl;
       cout<<\" * Data Type = long\"<<endl;

       gotoxy(1,24);
       cout<<\" ******************************************************************************\";
       gotoxy(1,25);
       cout<<\" ******************************************************************************\";

       gotoxy(1,10);
       cout<<\" Enter the array : \"<<endl<<endl;

       for(int count_1=0;count_1<array_size;count_1++)
      {
         cout<<\"\\t Element[\"<<count_1<<\"] = \";
         cin>>array[count_1];
      }

       bubble_sort(array,array_size);

       gotoxy(40,10);
       cout<<\" Sorted Array : \";

       for(int count_2=0;count_2<array_size;count_2++)
      {
         gotoxy(50,12+count_2);
         cout<<\"Element[\"<<count_2<<\"] = \"<<array[count_2]<<endl;
      }

       getch( );
       return 0;
    }



 //-----------------------  bubble_sort(long[],int)  ---------------------//


 void bubble_sort(long array[],int array_size)
    {
       for(int count_1=0;count_1<array_size;count_1++)
      {
         for(int count_2=0;count_2<array_size-1;count_2++)
        {
           if(array[count_2]>array[count_2+1])
              {
             long temp=array[count_2];
             array[count_2]=array[count_2+1];
             array[count_2+1]=temp;
              }
        }
      }
    }