Logo 
Search:

C++ Programming Articles

Submit Article
Home » Articles » C++ Programming » Mathematics ProgramRSS Feeds

Program to show the implementation of the Bubble Sort Algorithm

Posted By: Easy Tutor     Category: C++ Programming     Views: 3765

Write a program to show the implementation of the Bubble Sort Algorithm.

Code for Program to show the implementation of the Bubble Sort Algorithm in C++ Programming

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

 void bubble_sort(int [],constint);

 int main( )
 {
    clrscr( );
    textmode(BW80);

    constint array_size=10;

    int array[array_size]={0};

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

    cout<<"\n * Array size = 10"<<endl;
    cout<<" * Data Type = int"<<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( )  --------------------------///*************************************************************************/void bubble_sort(int array[],constint size)
 {
    for(int i=0;i<(size-1);i++)
    {
       for(int j=(size-1);j>=(i+1);j--)
       {
      if(array[(j-1)]>array[j])
      {
         int temp=array[(j-1)];

         array[(j-1)]=array[j];
         array[j]=temp;
      }
       }
    }
 }
  
Share: 



Easy Tutor
Easy Tutor author of Program to show the implementation of the Bubble Sort Algorithm is from United States. Easy Tutor says

Hello Friends,

I am Free Lance Tutor, who helped student in completing their homework.

I have 4 Years of hands on experience on helping student in completing their homework. I also guide them in doing their final year projects.

I have share many programs on this website for everyone to use freely, if you need further assistance, than please contact me on easytutor.2ya [at the rate] gmail [dot] com

I have special discount scheme for providing tutor services. I am providing tutor service to students from various contries, currently most of my students are from United States, India, Australia, Pakistan, Germany, UK and Canada.

I am also here to expand my technical network to receive more opportunity in my career, make friends to help them in resolving their technical problem, learn and share my knowledge, If you like to be my friend, Please send me friend request.

Thanks,
Happy Programming :)

 
View All Articles

 
Please enter your Comment

  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].

 
No Comment Found, Be the First to post comment!