int function ( int [ ] arg0 ) { int loc0 = 0 ; for ( int loc1 = 0 ; loc1 < arg0 . length ; loc1 ++ ) { int loc2 = 0 ; for ( int loc3 = loc1 ; loc3 < arg0 . length ; loc3 ++ ) { loc2 += arg0 [ loc3 ] ; if ( loc2 > loc0 ) { loc0 = loc2 ; seqStart = loc1 ; seqEnd = loc3 ; } } } return loc0 ; }
quadratic maximum contiguous subsequence sum algorithm . seqstart and seqend represent the actual best sequence . concode_field_sep int seqStart concode_elem_sep Random rand concode_elem_sep int seqEnd concode_field_sep void getTimingInfo concode_elem_sep int maxSubSum1 concode_elem_sep void main concode_elem_sep int max3 concode_elem_sep int maxSubSum3 concode_elem_sep int maxSubSum4 concode_elem_sep int maxSumRec