int function ( int arg0 [ ] ) { int loc0 = 0 ; for ( int loc1 = 0 ; loc1 < arg0 . length - 1 ; loc1 ++ ) { int loc2 = longestSubsequenceRecursive ( arg0 , loc1 + 1 , arg0 [ loc1 ] ) ; if ( loc2 > loc0 ) { loc0 = loc2 ; } } return loc0 + 1 ; }
recursive way of solving lis concode_field_sep PlaceHolder placeHolder concode_field_sep int longestSubsequenceWithActualSolution concode_elem_sep void main