# Java program to find length of the longest bitonic subarray

In this program, we are going to share a Java program to find length of the longest bitonic subarray. If you are a Java beginner and want to start learning the Java programming, then keep your close attention in this tutorial as I am going to share how to write a Java program to find length of the longest bitonic subarray.

• Collection of 100+ Java problems with solutions.

## Java program to find length of the longest bitonic subarray with the output

Copy the below Java program and execute it with the help of Javac compiler. At the end of this program, We have shared the output of this program.

```import java.io.*;
import java.util.*;

class Bitonic
{
static int bitonic(int arr[], int n)
{
int[] inc = new int[n];
int[] dec = new int[n];
int max;

inc[0] = 1;

dec[n-1] = 1;

for (int i = 1; i = arr[i-1])? inc[i-1] + 1: 1;

for (int i = n-2; i >= 0; i--)
dec[i] = (arr[i] >= arr[i+1])? dec[i+1] + 1: 1;

max = inc[0] + dec[0] - 1;
for (int i = 1; i  max)
max = inc[i] + dec[i] - 1;

return max;
}

public static void main (String[] args)
{
int arr[] = {12, 4, 78, 90, 45, 23};
int n = arr.length;
System.out.println("Length of max length Bitnoic Subarray is "
+ bitonic(arr, n));
}
}```

The post Java program to find length of the longest bitonic subarray appeared first on FreeWebMentor.

This post first appeared on Programming Blog Focused On Web Technologies, please read the originial post: here

# Share the post

Java program to find length of the longest bitonic subarray

×