Logo 
Search:

C++ Programming Articles

Submit Article
Home » Articles » C++ Programming » Data File StructureRSS Feeds

Program to illustrate the Insertion Sort

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

A C++ Program to illustrate the Insertion Sort.

Code for Program to illustrate the Insertion Sort in C++ Programming

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

 void insertion_sort(long [],int);


 main( )

    {
       clrscr( );

       constint array_size=10;

       long array[array_size]={0};

       cout<<"\n ******************************************************************************"<<endl;
       cout<<" *******************************  Insertion 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];
      }

       insertion_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;

    }


 /*************************************************************************///--------------------  insertion_sort(long[],int)  ---------------------///*************************************************************************/void insertion_sort(long array[],int array_size)
    {
       for(int i=1;i<array_size;i++)
      {
         long temp=array[i];

         int j=i;

         while(j>0 && temp<array[j-1])
        {
           array[j]=array[j-1];
           j--;
        }

         array[j]=temp;
      }
    }
  
Share: 


Didn't find what you were looking for? Find more on Program to illustrate the Insertion Sort Or get search suggestion and latest updates.

Easy Tutor
Easy Tutor author of Program to illustrate the Insertion Sort 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!