This is a Java Program to find peak element of an array. A peak element of an array is that element which is not smaller than its neighbors. Consider only one neighbour for corner elements. The time complexity of the following program is O (n).
Brute Force Algorithm is as follows :
for i in range (n) : if A[i - 1] <= A[i] >= A[i + 1] : print A[i] end if end for
Here is the source code of the Java program to find peak element of an array. 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 O(n) time (Naive Method) */ import java.util.Scanner; public class PeakElement1 { 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 + 2]; /* set corner values to -infinity */ arr[0] = Integer.MIN_VALUE; arr[N + 1] = Integer.MIN_VALUE; /* Accept N elements */ System.out.println("Enter "+ N +" elements"); for (int i = 1; i <= N; i++) arr[i] = scan.nextInt(); /* Find All Peak Elements */ System.out.println("\nAll Peak Elements : "); for (int i = 1; i <= N; i++) if (arr[i - 1] <= arr[i] && arr[i] >= arr[i + 1]) System.out.println(arr[i] +" at position "+ i); System.out.println(); } }
Enter size of array 6 Enter 6 elements 1 2 5 5 4 1 All Peak Elements : 5 at position 3 5 at position 4 Enter size of array 7 Enter 7 elements 6 24 15 2 23 99 67 All Peak Elements : 24 at position 2 99 at position 6 Enter size of array 10 Enter 10 elements 10 9 8 24 8 7 97 28 17 63 All Peak Elements : 10 at position 1 24 at position 4 97 at position 7 63 at position 10
Related posts:
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Java Program to Perform Partition of an Integer in All Possible Ways
Convert Hex to ASCII in Java
Guide to CountDownLatch in Java
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
RestTemplate Post Request with JSON
Java Program to Implement Quick Hull Algorithm to Find Convex Hull
Java Program to Implement Hash Tables chaining with Singly Linked Lists
Concurrent Test Execution in Spring 5
Chuyển đổi từ HashMap sang ArrayList
HttpAsyncClient Tutorial
The Registration Process With Spring Security
Java Program to Implement Sorted Doubly Linked List
Java Program to Implement VList
Giới thiệu Design Patterns
Java Scanner hasNext() vs. hasNextLine()
Upload and Display Excel Files with Spring MVC
Automatic Property Expansion with Spring Boot
The StackOverflowError in Java
Artem and Array
Java Convenience Factory Methods for Collections
Java Program to Perform Search in a BST
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
HttpClient 4 – Send Custom Cookie
Java Program to Check if a Point d lies Inside or Outside a Circle Defined by Points a, b, c in a Pl...
Java Program to Check Multiplicability of Two Matrices
A Guide to ConcurrentMap
Spring Boot - Exception Handling
Java Program to Implement AVL Tree
Java Program to Implement Fermat Primality Test Algorithm
Convert Hex to ASCII in Java