In this post, we will see how to find peak element in the array.

## Problem

Given an array of integers. find the peak element in the array.

** Peak Element** is the element of the array which is * GREATER THAN / EQUAL* TO its neighbours, that is, for an element at

**th index, the neighbour elements at index**

*i***i-1**&

**i+1**must be greater than equal to element at

**th position.**

*i*Now

An array can have several peak elements, we need to output any one of them.

## Solution

The basic approach to this problem would be iterate through the whole array and at every ** i **th element check the condition

**arr[i-1] = arr[i+1]**.

* For an array with equal numbers, every element will be peak element.

* For corner elements the conditions gets slightly tweaked as they will have only one

neighbour, that is,

for extreme left element we just need to check if

**arr[i+1] <= arr[i]**.

for extreme right element we just need to check

**arr[i-1] <= arr[i]**.

The worst time complexity of this approach would be

**O(n)**.

**Efficient Approach:**

We can use a Divide and conquer approach for the same which uses an algorithm similar to Binary search where a condition is checked with the middle element and depending on the result we search for our answer in one of the halves of the initial array. As the number of elements gets half on every call, this will have the worst time complexity of ** O(log(n)).**

**Algorithm** :

We compare middle element of the array with its neighbours and if it is greater than or equal to its neighbours. If the middle element is greater than or equal to its neighbours, we return it.

If the element is smaller than its left neighbour then it is sure that the peak element lies in left.

**WHY?**

Consider an Array,

**int[] arr = {a1, a2, a3, a4, a5, a6, a7};**

There arise 2 cases when left neighbour**(a3)** is greater than middle element**(a4)** i.e. **a3** > **a4**:

**Case-1** : if the left neighbour**(a3)** is corner, then this is our peak element.

**Case-2** : if left element is not the corner element.Here again 2 possibilities arise, that is,

- if
**a2**>**a3**, then this becomes the same recursive subproblem which we discussed

above and its result will eventually be calculated recursively. - if
**a2**<**a3**, then again**a3**is our peak element because,**a3**>**a2**&**a3**>**a4**, i.e.**a3**is greater than or equal to its neighbours.

The same procedure is followed the case when right neighbour (a5) is greater than middle element.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 |
package org.ayush.java2blog; import java.util.Scanner; public class PeakElement { public static void main(String[] args) { Scanner scn = new Scanner(System.in); int[] arr = new int[scn.nextInt()]; for (int i = 0; i < arr.length; i++) { arr[i] = scn.nextInt(); } int peakIndex = solve(0, arr.length - 1, arr); System.out.print("arr[]: {"); for (int i = 0; i < arr.length; i++) { System.out.print(" "+arr[i]); } System.out.println(" }"); System.out.println("Peak element is : " + arr[peakIndex] + " found at index " + peakIndex); } public static int solve(int start, int end, int[] arr) { // finding mid for dividing the array into two parts int mid = (start + end) / 2; // if the mid element is not the corner element and it is greater // than or equal to its neighbours if ((mid > 0 && mid < arr.length - 1) && (arr[mid] >= arr[mid + 1] && arr[mid] >= arr[mid - 1])) { return mid; } // if the mid element is left corner element and it is greater //than or equal to its right neighbour. else if (mid == 0 && mid!= arr.length-1 && arr[mid] >= arr[mid + 1]) { return mid; } // if the mid element is right corner element and it is greater // than or equalto its left neighbour. else if (mid == arr.length - 1 && mid!= 0 && arr[mid - 1] <= arr[mid]) { return mid; } // if mid element is smaller than its left neighbour, // then peak element will be in left side for sure. else if (mid != 0 && arr[mid - 1] > arr[mid]) { return solve(start, mid - 1, arr); } else { if(mid + 1 <= arr.length-1) { return solve(mid + 1, end, arr); } } // in case the array has only one element then than is the //peak element return 0; } } |

When you run above program, you will get below output.

arr[]: { 10 20 40 15 }

Peak element is : 40 found at index 2

That’s all about how to find peak element in the array.

Comment in case of any doubt or edit. Happy Learning 🙂

#### Latest posts by Ayush Kumar (see all)

- Kruskal’s Algorithm for finding Minimum Spanning Tree – January 30, 2019
- Coin Change Problem in java – December 8, 2018
- Bellman Ford Algorithm in java – November 30, 2018

#### Join Our News Letter – Stay Updated

**Subscribe to Awesome Java Content**.