Single_element_in_sorted_array.cpp

int singleNonDuplicate(vector<int> &nums)
{
    // Write your code here
    int n = nums.size();
    int low = 0;
    int high = n - 2;

    while (low <= high)
    {
        int mid = (low + high) / 2;

        if (mid % 2 == 0)
        {
            if (nums[mid] != nums[mid + 1])
                high = mid - 1;
            else
                low = mid + 1;
        }
        else
        {

            if (nums[mid] == nums[mid + 1])
                high = mid - 1;
            else
                low = mid + 1;
        }
    }

    return nums[low];
}