Skip to main content

Function to sort an array using insertion sort

Insertion sort is slightly better sorting method among O(n2) algorithms. It is effecient if the elements are almost sorted and if the size is small.

Insertion sort basically works by splitting your elements into two parts. Sorted half and unsorted half. To begin with, Sorted half is empty and unsorted half has all elements. Then one element is removed from unsorted half and added to the sorted half. When adding , this element is inserted at the correct location. This process is continued till we have all the elements in sorted half and unsorted half is empty. Now let us try to understand it with a diagram.
First 17 is removed from unsorted array and added to sorted array. Since there is one element there, it is sorted. Next 4 which is front most element now in unsored array is removed and added to sorted array. But 4 is smaller than 17, so 17 is pushed to right and its place is taken by 4.
   Next 32 is removed from the front of unsorted array and added to sorted array. But here in sorted array to last element 17 is smaller. So 32 is in its correct place. Next 1 is moved from front of unsorted array. In sorted array, 32 is larger and pushed to right. Next 17 is pushed to right and 4 is also pushed to right. Now 1 is placed in 4's position. As you can see, now these 4 elements are sorted. This process continues until all the elements are removed from unsorted array.
   Removing front most element from the array takes O(1) X N elements. And inserting an element takes in worst case O(N) time. Hence complexity is O(N2 ) .
C++ function to insertion sort an array is really very simple and small.

#include<iostream>
using std::cin;
using std::cout;

void insertionSort(int *arr,int size);
void printArray(int *arr,int size);
int main()
{
    int n;
    cout<<"Size of array:";
    cin>>n;
    int a[n];
    cout<<"Elements of array:";
    for(int i=0;i<size;i++)
         cin>>a[i];
     insertionSort(a,n);
     printArray(a,n);
     return 0;
}

void insertionSort(int *arr,int size)
{
   for(int i=1;i<size;i++)
   {
        int val = arr[i];
        int j;
        for(j=i-1;j>=0 && arr[j] >val;j--)
        {
                 arr[j+1]=arr[j];
         }
         arr[j+1]=val;
   }
}


void printArray(int *arr,int size)
{
     for(int i=0;i<size;i++) 
            cout<< arr[i]<<"=====";
 
 }

In the insertionSort function, outer loop is for extracting one element from unsorted array. And inner loop is for inserting it in the sorted array and pushing elements to right as needed.
Writing insertion sort for linked list is much simple as well. You take one more linked list - sortedList. Now remove front element from list and insert it in ascending order in sortedList.
Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Function to add a node to binary search tree

Binary search tree (BST) is an ordered tree where each node has smaller values on the left sub tree and larger values on the right subtree. This is similar to binary search algorithm. And another useful fact is if you traverse the node in in-order method, the values of the tree will be in ascending order. Binary Search Tree with root as 50 Now as you can see from the diagram on the left child and their children of root (which in this case is 50), values are 40, 20 and 45. All are less than 50. On the other hand, on the right sub tree 50, the values are 60, 55 and 78 - larger than 50. And this rule follows for each and every node, not just root. Now if we have to  add a node - let us 43, where shall we add it, in such a way that the tree will still remain as BST. The new node must be a leaf node (i.e. the node with no child nodes) Let us traverse from root and find out where this new node fits. 43 is smaller than 50. Hence we must branch to left of 50. Now we get 40. 4...
Post a Comment
Read more

Program to create a Linked List in C

An array is a commonly used data structure in most of the languages. Because it is simple, it needs O(1) time for accessing elements. It is also compact. But an array has a serious drawback - it can not grow or shrink. You need to estimate the array size and define it during compile time. This drawback is not present a linked list. A linked list is a data structure which can grow or shrink dynamically.  A linked list has nodes each of which contain  contain  data and a link to next node . These nodes are dynamically allocated structures. If you need more nodes, you just need to allocate memory for these and link these nodes to the existing list. The nodes of a linked list have to be defined as self-referential structures in C. That is structures with data members and one member which is a pointer to the structure of same type.  This pointer will work as a link to next node. struct node { int data; struct node * next; //pointer to another node }...
1 comment
Read more