//直接插入排序
void DirectInsertionSort(int* arr, int nLen)
{
    int i, j;
    for (i=1; i=0; j--)
        {
            if (temp < arr[j])
                arr[j+1] = arr[j];
            else
                break;
        }
        if (j+1 != i)
            arr[j+1] = temp;    //注意这里是j+1
    }
}

//折半插入排序
void BinaryInsertionSort(int* arr, int nLen)
{
    int i, j;
    int low, mid, high;
    for (i=1; i=low; j--)
            {
                arr[j+1] = arr[j];
            }
            arr[low] = temp;
        }
    }
}