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

Binary tree deletion - non-recursive

In the previous post we have seen how to delete a node of a binary search tree using recursion. Today we will see how to delete a node of BST using a non-recursive function. Let us revisit the 3 scenarios here Deleting a node with no children just link the parent to NULL Deleting a node with one child link the parent to  non-null child of node to be deleted Deleting a node with both children select the successor of node to be deleted copy successor's value into this node delete the successor In order to start, we need a function to search for a node in binary search tree. Did you know that searching in  a BST is very fast, and is of the order O(logn). To search Start with root Repeat until value is found or node is NULL If the search value is greater than node branch to right If the search value is lesser than node branch to left.  Here is the function NODEPTR find_node (NODEPTR root,NODEPTR * parent, int delval) { NODEPTR nd = root; NODEPTR pa = root; if (ro...
Post a Comment
Read more

Function to sort an array using bubble sort

Quick and dirty way of sorting an array is bubble sort. It is very easy to write and follow. But please keep in mind that it is not at all effecient. #include<iostream> using std::cin; using std::cout; void readArray(int arr[],int sz); void printArray(int arr[],int sz); void sortArray(int arr[],int sz); void swap(int &a,int &b); int main() {    int sz;    cout<<"Size of the array=";    cin>>sz;    int arr[sz];    readArray(arr,sz);     sortArray(arr,sz);   cout<<"Sorted array is ";   printArray(arr,sz); } void readArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";       cin>>arr[i];   } } void printArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";    ...
Post a Comment
Read more