You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
51 lines
1.5 KiB
Java
51 lines
1.5 KiB
Java
/*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).*/
|
|
|
|
/*
|
|
* 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 |