Explain the depth of recursion?

Submitted by: Administrator
This is another recursion procedure which is the number of times the procedure is called recursively in the process of enlarging a given argument or arguments. Usually this quantity is not obvious except in the case of extremely simple recursive functions, such as FACTORIAL (N), for which the depth is N.
Submitted by: Administrator

Read Online Programming Algorithms Job Interview Questions And Answers