二分数组的扩展：二分查找循环有序数组

#include 
#include 
using namespace std;

int findPos(const vector& array, int var)
{
    size_t start = 0;
    size_t end = array.size();

    while(start <= end)
    {
        int middle = start + (end - start) / 2;
        if(array[middle] >= array[start])
        {
            if(var == array[middle])
            {
                return middle;
            }
            else if(var = array[start])
            {
                end = middle - 1;
            }
            else 
            {
                start = middle + 1;
            }
        }
        else 
        {
            if(var == array[middle])
            {
                return middle;
            }
            else if(var > array[middle] && var <= array[end])
            {
                start = middle + 1;
            }
            else
            {
                end = middle - 1;
            }
        }
    }
    return -1;
}

int main()
{
    //int Array[] = {4, 5, 1, 2, 3};
    //int Array[] = {4, 5, 1, 1, 3};
    int Array[] = {7,8,9,0,1,2,3,4,5,6};
    
    std::cout <(Array, Array + sizeof(Array) / sizeof(int)), 9) <    return 0;
}