Java implementation to find the maximum sum bitonic subarray
import java . util . * ; class GFG { static int find_partial_sum ( int arr [ ] , int start , int end ) { int sum = 0 ; for ( int i = start ; i < end ; i ++ ) sum += arr [ i ] ; return sum ; }