Find Peak Element.md

A peak element is an element that is strictly greater than its neighbors.

Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.

You may imagine that nums[-1] = nums[n] = -∞.

You must write an algorithm that runs in O(log n) time.

Binary search Time complexity: O(log(n))

/**
 * @param {number[]} nums
 * @return {number}
 */
var findPeakElement = function(nums) {
    let start = 0, end = nums.length - 1;
    while(start < end) {
        let mid = Math.floor((start + end) / 2);
        if(nums[mid] > nums[mid + 1]) {
            end = mid;
        }
        else {
            start = mid + 1
        }
    }
    return start
};