Binary Search

<-E 704> Binary Search

class Solution {
public:
    int search(vector<int>& nums, int target) {
        
        int low = 0, high = nums.size(), mid;
        while (low < high){
            mid = low + (high - low) / 2;
            if (nums[mid] == target)
                return mid;
            else if (nums[mid] > target)
                high = mid;
            else
                low = mid + 1;
        }
        
        return -1; 
    }
};