LeetCode - 33 Search in Rotated Sorted Array

class Solution {
public:
    int binary_search_bigger_than_next(vector<int>& nums,int b,int e){
        if(b==e&&nums[b]>nums[b+1]){
            return b;
        }
        else{
            int mid=(b+e)/2;
            if(nums[b]<=nums[mid]&&nums[mid]<=nums[e]){
                return nums.size()-1;
            }
            else if(nums[b]>=nums[mid]){
                return binary_search_bigger_than_next(nums,b,mid);
            }
            else{
                return binary_search_bigger_than_next(nums,mid,e);
            }
        }
    }
    int binary_search(vector<int>& nums,int b,int e,int p){
        if(b>e){
            return -1;
        }
        if(b==e){
            if(nums[b]==p){
                return b;
            }
            else{
                return -1;
            }
        }
        else{
            int mid=(b+e)/2;
            if(p<=nums[mid]){
                return binary_search(nums,b,mid,p);
            }
            else{
                return binary_search(nums,mid+1,e,p);
            }
        }
    }
    int search(vector<int>& nums, int target) {
        if(nums.size()==1){
            if(nums[0]==target){
                return 0;
            }
            else{
                return -1;
            }
        }
        int k=binary_search_bigger_than_next(nums,0,nums.size()-1);
        if(k==nums.size()-1){
            return binary_search(nums,0,k,target);
        }
        if(target<=nums[nums.size()-1]){
            return binary_search(nums,k+1,nums.size()-1,target);
        }
        else{
            return binary_search(nums,0,k,target);
        }
    }
};