二分查找算法的应用

int MinInorder(int* arr, int start, int end)
{
    int result = arr[start];
    bool check = false;
    while (start <= end)
    {
        ++start;
        if (arr[start] < result)
            return arr[start];
    }
    return result;
}

int Min(int* arr, int lenth)
{
    if (arr == NULL || lenth <= 0)
    {
        cout << "Error:Invalid Parameters" << endl;
        return 0;
    }
    int start = 0, middle, end = lenth - 1;
    while (start < end)
    {
        middle = (end - start) / 2 + start;
        if (end - start == 1)
            return arr[end];
        if (arr[middle] == arr[start] && arr[middle] == arr[end])
            return MinInorder(arr + start, start, end);
        if (arr[middle] >= arr[start])  //非特例情况下
            start = middle;
        else
            end = middle;
    }
}