This is the Java Program to Find the Maximum Sum in a Contiguous Sub-Array. Problem Description Given an array of integers, find the contiguous subarray, whose sum of the elements, is maximum. Example: Array = [2 1 3 5 -2 1 -3 8] Output: Subarray = [2 1 3 5 -2 1 -3 8] Sum … Read more
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 … Read more
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 … Read more
This is a Java Program to find minimum element of a rotated sorted array. The following program uses a binary search approach to find the minimum element of a rotated sorted array. Time complexity is O (log n) Here is the source code of the Java program to find minimum element of a rotated sorted … Read more
