Peak element GFG

 package com.company;

public class PeakElement {
//    Finding the peak element
    public static int peak(int[] arr){
        int n = arr.length;
        if(n == 1) {
            return arr[0];
        }
        if(arr[0] >= arr[1]){
            return arr[0];
        }
         if(arr[n -1] >= arr[n - 2]){
            return arr[n - 1];
        }
            for (int i = 1; i < n - 1; i++) {
                if (arr[i] >= arr[i - 1] && arr[i] >= arr[i + 1]) {
                    return arr[i];
                }
            }
        return -1;
    }
//    Efficient solution
    public static int getPeakElement(int[] arr) {
        int n = arr.length;
        int low = 0,  high = n - 1;
        while(low <= high){
            int mid = (low + high) / 2;
            if((mid == 0 || arr[mid - 1] <= arr[mid]) && (mid == n - 1 || arr[mid + 1] <= arr[mid])) {
                return mid;
            }
            if(mid > 0 && arr[mid - 1] >= arr[mid]){
                high = mid - 1;
            }
            else {
                low = mid + 1;
            }
        }
        return -1;
    }
    public static void main(String[] args) {
        int[] array = {5,10,20,15,7,56};
        System.out.println(getPeakElement(array));
    }
}