插入排序之希尔排序

void shell_sort()
{
    unsigned char i=0,j=0,gap;
    unsigned char arr[10] = {4,1,3,9,6,2,8,5,0,7};
    unsigned char len = sizeof(arr);
    unsigned char temp;
    char k;
    gap = len;
    while(gap)
    {
        gap /= 2;
        /*共gap个数组，对每一组都进行直接插入排序*/
        for(i = 0; i < gap; i++)
        {
            /*如果后值小于前值，则寻找后值位置*/
            for( j = i+gap; j < len; j += gap)
            {
                if(arr[j] < arr[j - gap])
                {
                    temp = arr[j];
                    k = j-gap;
                    while(k >= 0 && arr[k] >temp)
                    {
                        arr[k + gap] = arr[k];
                        k -= gap;
                    }
                    arr[k + gap] = temp;
                }                
            }
        }
    }
    
    for(i=0;i<10;i++)
    {
        printf("%d\n",arr[i]);
    }
}