Essay --

Draw backs of recursion Recursion consumes more memory and stack space. Every recursive method call produces a new instance of the method, one with a new set of local variables. The total stack space used depends upon the level of nesting of the recursion process, and the number of local variables and parameters. Recursive version is usually slower. Recursion may perform redundant computations. In sum, one has to weight the simplicity of the code delivered by recursion against its drawbacks as described above. When a relatively simple iterative solution is possible, it is definitely a better alternativeIn recursion factorial we must ensure that factorial is never ever called with a negative N. Recursion method less efficient. Recursive version is shorter, clearer and slower. Recursion offers more elegant solutions. Use recursion for clarity and for a reduction in the time needed to write and debug code, not for space savings or speed of execution.Recursion can be savior at times- Act ually lead recursion whenever we deal with data structure related to linked list or xml for gener...