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