插入排序

void insert_sort(int *p, UINT n){    UINT index = 0;  //{ 8,5,4,5,7 };    UINT i = 0, j = 0, k = 0;    int temp = 0;    for (i = 1; i < n; i++)    {        index = i;        for (j = 0; j < i; j++) // j=0 j-1一个很大的数        {            if (p[i] < p[j])            {                index = j;                break;            }        }        temp = p[i];        for (k = i; k > index; k--)        {            p[k] = p[k - 1];        }        p[index] = temp;    }}