Insertion Sorting In C++ , Data Structures & Algorithms.

 Insertion Sort Algorithm:

This is an in-place comparison-based sorting algorithm. Here, a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. An element that is to be inserted in this sorted sub-list has to find its appropriate place, and then it has to be inserted there. Hence the name, insertion sort.

The array is searched sequentially and unsorted items are moved and inserted into the sorted sub-list (in the same array). This algorithm is not suitable for large data sets as its average and worst-case complexity are of Ο(n2), where n is the number of items.

C++ Implementation:

#include<iostream>

#include<conio.h>

using namespace::std;

 int main()

 {

  system("color e5");

     int inner,outer,temp,array[]={4,65,23,112,55};

     cout<<"Before Sorting : ";

     for(int e=0;e<5;e++)

     {

           cout<<array[e]<<" ";

  }

  for(outer=1;outer<5;outer++)

  {

      inner=outer;

      temp=array[outer];

     while(inner>0&&temp<array[inner-1])

      {

           array[inner]=array[inner-1];

           inner--;

      }

      array[inner]=temp;

  }

  cout<<endl<<"After Insertation Sorting : ";

 for(int r=0;r<5;r++)

 {

    cout<<array[r]<<" ";

 }

   getch();

 }