Home » C Programming » Functions

Usually recursion works slower than loops.

Correct Answer: Yes

Explanation:

When a recursive call is made, the function/process clones itself and then process that funtion. This leads to time and space constrains.


In a loop, there is no recursive call involved that saves a lot of time and space too.


← Previous Question Next Question→

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion