Abstract
The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly correct recursive algorithms are, indeed, invalid or non-optimal. A simple context-free grammar for generating strings of balanced parentheses is then used to show the difficulty of programming recursive algorithms in block-structured languages. Other factors contributing to the difficulty in understanding recursive algorithms implemented in block-structured languages are also identified. It is suggested that more research needs to be done to foster the science of recursive programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
