Program to illustrate the Bubble Sorting of arrays

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

 void sort_ascending_order(int [],int);
 void sort_decending_order(int [],int);
 void print_array(int [],int);

 main()
    {
       clrscr();

       const int array_size=10;
       int array[array_size]={0};

       cout<<\"\\n Enter the contents of the array are : \"<<endl;

       cout<<\"\\n     Elements :\"<<\"\\t\\t     Value:\"<<endl;

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

       getch();
       clrscr();

       cout<<\"\\n The contents of the array in original order are : \"<<endl;
       print_array(array,array_size);

       int order=0;

       cout<<\"\\n Press the key_..\"<<endl;
       cout<<\"\\t 1 to sort in ascending order\"<<endl;
       cout<<\"\\t 2 to sort in decending order\"<<endl;

       cout<<\"\\n\\n Enter your choice  =  \";
       cin>>order;

       if(order==1)
      sort_ascending_order(array,array_size);

       else if(order==2)
      sort_decending_order(array,array_size);

       getch();
       clrscr();

       if(order==1)
      cout<<\"\\n The contents of the array in ascending order are : \"<<endl;

       else if(order==2)
      cout<<\"\\n The contents of the array in decending order are : \"<<endl;

       print_array(array,array_size);

       getch();
       return 0;
    }


 //------------------------  print_array(int [],int)  --------------------//


 void print_array(int array[],int size)
    {
       cout<<\"\\n     Elements :\"<<\"\\t\\t     Value:\"<<endl;

       for(int count=0;count<size;count++)
      cout<<\"\\t\"<<\" array [\"<<count<<\"]\"<<\"\\t\\t\"<<array[count]<<endl;
    }


 //------------------  sort_ascending_order(int [],int)  -----------------//


 void sort_ascending_order(int array[],int size)
    {
       for(int count_1=0;count_1<size;count_1++)
      {
         for(int count_2=0;count_2<size-1;count_2++)
        {
           int temp=0;

           if(array[count_2]>array[count_2+1])
              {
             temp=array[count_2];
             array[count_2]=array[count_2+1];
             array[count_2+1]=temp;
              }
        }
      }
    }


 //------------------  sort_decending_order(int [],int)  -----------------//


 void sort_decending_order(int array[],int size)
    {
       for(int count_1=0;count_1<size;count_1++)
      {
         for(int count_2=0;count_2<size-1;count_2++)
        {
           int temp=0;

           if(array[count_2]<array[count_2+1])
              {
             temp=array[count_2];
             array[count_2]=array[count_2+1];
             array[count_2+1]=temp;
              }
        }
      }
    }