Insertion Sort

Insertion Sort is a simple sorting algorithm that build final sorted element in the array. The insertion sort give more efficient way and give more advantage than other sort like quick sort, merge sort and heap sort. 

It’s specialties are :

  • Simple
  • More efficient ( Time Complexity O(n2) )
  • Only required constant amount of memory requirement. ( O(1) )

     for i=1 to n-1{
          element = array[i];
          while(j>0 and array[j-1] > element ){
                 array[j] = array[j-1];
          array[j] = element;

Implementation is below :


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s