int function ( int arg0 ) { validateInput ( arg0 ) ; if ( arg0 == 0 ) { return 1 ; } else { return arg0 * getRecursive ( arg0 - 1 ) ; } }
recursive implementation of the previous algorithm . the complexity order in time and space terms is the same . take into account that this implementation is not tail recursive . concode_field_sep PlaceHolder placeHolder concode_field_sep int getIterative concode_elem_sep void validateInput concode_elem_sep int getTailRecursiveInner concode_elem_sep int getTailRecursive