Algorithm--c++--Insert Sort--

1. Arrange the entire array:

void insertsort (int array[],int num) {    int i,j,k;    for (j = 1;j <= num-1;j++)    {        k = j;        int key = Array[j];        for (i = j-1;i >= 0;i--)            if (Array[i] > key)             {                array[i + 1] = Array[i];                K = i;             }        ARRAY[K] = key;    }}

2. Arrange the specified interval of the array:

void Insertsort (int array[],int start,int end) {    int i,j,k;    for (j = start;j <= end-1;j++)    {        k = j;        int key = Array[j];        for (i = j-1;i >= start-1;i--)        {            if (Array[i] > key)            {                array[i + 1] = Array[i];                K = i;            }        }        ARRAY[K] = key;    }}

Algorithm is very important, but also I am relatively weak link (in fact, novice programmer = =, seemingly no aspect of not weak = =). Just the Qingming Festival holiday, did not go home, and encountered rain, in the dorm nothing to do, so intend to practice algorithm, the next day to practice an algorithm. But because it is a rookie, so the code is just run correctly, but also very slag, slowly again to improve it!

Algorithm--c++--Insert Sort--