162. Find Peak Element

class Solution {
    public int findPeakElement(int[] nums) {
        
        /*
        int index = 0, max = nums[0];
        
        for(int i = 0; i < nums.length; i++)
        {
            if(max < nums[i])
            {
                max = nums[i];
                index = i;
            }
        }
        
        return index;
        
        */
        
        return findPeakElementBinarySearch(nums);
    }
    
    int findPeakElementBinarySearch(int[] nums)
    {
        int start = 0, end = nums.length - 1;
        
        while(start < end)
        {
            int mid = start + (end - start) / 2;
            
            if(nums[mid] < nums[mid + 1])
            {
                start = mid + 1;
            }
            else
            {
                end = mid;
            }
        }
        
        return start;
        
    }
}