GIVING TLE ON PEAK ELEMENT(BINARY SEARCH)

#1

QUES-https://leetcode.com/problems/find-peak-element/

CODE- https://ide.codingblocks.com/s/236737

PLEASE HELP IN THIS

#2

@hunt
no need for such a long code.
u can refer to dis

int solve(vector<int>& nums, int start, int end)
{
    if(start>end)
        return end;
    int mid = start + (end-start)/2;
    if(mid-1<0 || nums[mid]>nums[mid-1])
        return solve(nums, mid+1, end);
    else
        return solve(nums, start, mid-1);
}
hope dis helps