Javascript implementation to find the maximum sum bitonic subarray
function find_partial_sum ( arr , start , end ) { let sum = 0 ; for ( let i = start ; i < end ; i ++ ) sum += arr [ i ] ; return sum ; }