Java Program to Find Peak Element of an Array using Binary Search

This is a Java Program to find peak element of an array. A peak element of an array is that element which is greater than its neighbors. The following program uses binary search approach to find a peak element. The time complexity of the following program is O (log n).

Here is the source code of the Java program to find peak element of an array using binary search. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

```
/*
```

 * Java Program to Find the peak element of an array using

```
 * Binary Search approach
```
```
 */
```
```
import java.util.Scanner;
```
```
 
```
```
public class PeakElement2    
```
```
{
```

    public static void main(String[] args)

```
    {
```

        Scanner scan = new Scanner(System.in);

        System.out.println("Enter size of array");

```
        int N = scan.nextInt();
```
```
        int[] arr = new int[ N ];
```
```
        /* Accept N elements */
```

        System.out.println("Enter "+ N +" elements");

```
        for (int i = 0; i < N; i++)
```
```
            arr[i] = scan.nextInt();
```

        /* Find Peak Elements */

        System.out.print("\nPeak Elements : ");

```
        peak(arr);
```
```
        System.out.println();
```
```
    } 
```
```
    public static void peak(int[] arr)
```
```
    {
```
```
        peak(arr, 0, arr.length - 1);
```
```
    }    
```

    public static void peak (int arr[], int low, int high)

```
    {
```
```
        int N = arr.length;
```
```
        if (high - low < 2)
```
```
            return;
```
```
        int mid = (low + high) / 2;
```

        if (arr[mid] > arr[mid - 1] && arr[mid] > arr[mid + 1])

            System.out.print(arr[mid] +" ");

        /* Recursively find other peak elements */

```
        peak (arr, low, mid);
```
```
        peak (arr, mid, high);    
```
```
    }        
```
```
}
```

Enter size of array
8
Enter 8 elements
87 63 51 25 40 24 6 1
 
Peak Elements : 40

Sanfoundry Global Education & Learning Series – 1000 Java Programs.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

If you wish to look at all Java Programming examples, go to Java Programs.

« Prev - Java Program to Find Peak Element of an Array using Naive Method

» Next - Java Program to Find the Maximum Subarray Sum using Naive Method

Next Steps:

Get Free Certificate of Merit in Java Programming
Participate in Java Programming Certification Contest
Become a Top Ranker in Java Programming
Take Java Programming Tests
Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Related Posts:

Apply for Java Internship
Practice Information Technology MCQs
Practice BCA MCQs
Buy Java Books
Apply for Information Technology Internship

Recommended Articles: