This is a java program to find the maximum element using binary search technique. Binary search requires sequence to be sorted. We return the last element of the sequence, which is maximum.

Here is the source code of the Java Program to Find Maximum Element in an Array using Binary Search. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

`//This is a java program to find maximum element using Binary Search`

import java.util.Random;

public class Maximum_Using_Binary

`{`

static int N = 20;

static int []sequence = new int[N];

public static void sort()

`{`

int i, j, temp;

for (i = 1; i< N; i++)

`{`

j = i;

temp = sequence[i];

while (j > 0 && temp < sequence[j-1])

`{`

sequence[j] = sequence[j-1];

j = j-1;

`}`

sequence[j] = temp;

`}`

`}`

public static void main(String args[])

`{`

Random random = new Random();

for(int i=0; i<N; i++)

sequence[i] = Math.abs(random.nextInt(100));

System.out.println("The sequence is :");

for(int i=0; i<N; i++)

System.out.print(sequence[i] + " ");

sort();

System.out.println("\nThe maximum element in the sequence is : " + sequence[N-1]);

`}`

`}`

Output:

$ javac Maximum_Using_Binary.java $ java Maximum_Using_Binary The sequence is : 40 60 99 69 71 90 33 83 7 79 49 67 24 23 36 46 55 13 98 8 The miaximum element in the sequence is : 99

**Sanfoundry Global Education & Learning Series – 1000 Java Programs.**

Here’s the list of Best Reference Books in Java Programming, Data Structures and Algorithms.

» Next Page - Java Program to Find Median of Elements where Elements are Stored in 2 Different Arrays