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

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

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

Binary tree deletion

Do not get all scared and worried. It is not rocket science (or as I would like to call it - it is not regex). Remember deleting a node from linked list. When you deleted a node, you did the following 2 steps Free the memory of the node Link the previous node of the deleted node to the next node You will have to do these things in binary tree too. But the difficulty here is do you link the previous node - or parent node in tree terminology, to the left child of deleted node? Or to the right child? You can not link both children, as the parent already may have one child node. So before we solve this, let us categorize the deletion with the help of a diagram. Consider the cases The node to be deleted is a leaf node. That is, it does not have left or right child. In this case, link the parent to NULL in place of deleted node.  If you want to delete 13 - which is a leaf node, you set 14->left to NULL and free memory of node 13. If you want to delete 7 - which is also a leaf node and...
Post a Comment
Read more