Which of the following statements are true?
■ Any recursive function can be converted into a nonrecursive function.
■ Recursive functions take more time and memory to execute than nonrecursive functions.
■ Recursive functions are always simpler than nonrecursive functions.
■ There is always a selection statement in a recursive function to check whether a base case is reached.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.