find_peak_element.cpp

class Solution {
public:
    int findPeakElement(const vector<int> &num) {
        
        if (num.size() <= 1) return 0; //if only one element return 0th index
        
        int mid = 0, l = 0, h = num.size() - 1;
        while (l < h) {
            mid = l + (h-l) / 2;
            if (num[mid] > num[mid + 1])
                h = mid;
            else if (num[mid] < num[mid + 1])
                l = mid + 1;
        }

        return l;
    }
};