Find Minimum in Rotated Sorted Array

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/

class Solution {
public:
    int findMin(vector<int>& nums) {
        int size=nums.size();
        if(size==0)
            return 0;
        if(size==1)
            return nums[0];
        int index1=0;
        int index2=size-1;
        if(nums[index1]<nums[index2])
            return nums[index1];
        int middle=(index1+index2)/2;
        while(index1!=middle&&index2!=middle)
        {
            if(nums[middle]>nums[index2])
            {
                index1=middle;
            }
            else
            {
                index2=middle;
            }
            middle=(index1+index2)/2;
        }
        return nums[index2];
    }
};