Programming Algorithms Question: Download Questions PDF
Explain the depth of recursion?
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.
Download Programming Algorithms Interview Questions And Answers PDF
|Previous Question||Next Question|
|Explain about procedural body and computation boxes?||State the problems which differentiate between recursive procedure and non-recursive procedure?|