Direct Insert Sort

Direct Insert Sort

Basic idea: Suppose that the records to be sorted are stored in the array R[1..N]. Initially, r[1] self into 1 ordered areas, unordered area is R[2..N]. From i=2 up to i=n, sequentially insert r[i] into the current ordered area R[1..i-1], generating an ordered area with N Records.

Code implementation:

#include <stdio.h> #include <iostream>using namespace std;int n;void insertsort (int a[]) {    int i,j;    for (i=2;i<=n;i++)    {        if (a[i]<a[i-1])        {            a[0]=a[i];    Sentinel            A[i]=a[i-1];            for (j=i-2;a[0]<a[j];j--)                a[j+1]=a[j];        Move            a[j+1]=a[0];}        }    } int main () {    int a[100],i;    cin>>n;    for (i=1;i<=n;i++)        cin>>a[i];    Insertsort (a);    for (i=1;i<=n;i++)        cout<<a[i]<< "";    return 0;}

Direct Insert Sort