Create a halting condition $($base case$)$ for a recursive algorithm

Please repair the method recursiveMultiply$()$ so that it halts properly. The method accepts one argument and should return its result as an integer.

As discussed before, a recursive algorithm can be quite slow. It's time complexity is proportional to the square of the number of iterations. The real benefit of a recursive algorithm is simplifying the code and reducing the number of lines somewhat must write. But speed is not the only problem with a recursive function. Because they call themselves, Without a Halting Condition a recursive function can run infinitely and hang the program.

Please repair the method recursiveMultiply$()$ so that it halts properly. The method accepts one argument and should return it's result as an integer.

Solution

Reset

Java

Sample Test Case #$1$

$10$

Execute code

STDOUT

Expected STDOUT

$3628800$

Next question