Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quick sort, heap sort, or merge sort.
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Sorting is typically done in-place, by iterating up the array, growing the sorted list behind it. At each array-position, it checks the value there against the largest value in the sorted list (which happens to be next to it, in the previous array-position checked). If larger, it leaves the element in place and moves to the next. If smaller, it finds the correct position within the sorted list, shifts all the larger values up to make a space, and inserts into that correct position.

/* C++ Program to implement Insertion Sort */

#include<iostream> using namespace std; void INSERTION_SORT(int [],int ); int main() { char ch; do { int n; cout<<"Enter the no. of elements in the array"<<endl; cin>>n; int a[n]; cout<<"Enter the elements in the array"<<endl; for(int i=1;i<=n;i++) { cin>>a[i]; } INSERTION_SORT(a,n); cout<<"::::Sorted Output:::"<<endl; for(int k=1;k<=n;k++) { cout<<a[k]<<" "; } cout<<endl<<"Press 'y' or 'Y' to continue!!!"; cin>>ch; }while(ch=='y'||ch=='Y'); return 0; } void INSERTION_SORT(int a[],int n) { int key,i,j; for(j=2;j<=n;j++) { key=a[j]; i=j-1; while((i>0)&&(a[i]>key)) { a[i+1]=a[i]; i=i-1; } a[i+1]=key; } }

//Output of the above program

Insertion Sort Using C++ |

**Related Programs:-**

★ Merge Sort using C++

★ Heap Sort using C++

★ Magic Square Game

★ Convert a given number into string

★ Tic Tac Toe Game

This comment has been removed by a blog administrator.

ReplyDeleteThis comment has been removed by a blog administrator.

ReplyDelete