Reading 14: Recursion

In today’s class, we’re going to talk about how to implement a function, once you already have a specification. We’ll focus on one particular technique, recursion. Recursion is not appropriate for every problem, but it’s an important tool in your software development toolbox, and one that many people scratch their heads over. We want you to be comfortable and competent with recursion, because you will encounter it over and over. (That’s a joke, but it’s also true.)

Reading 14: Recursion Reading 14: Recursion Software in 6.031 Safe from bugs Easy to understand Ready for change Correct today and correct in the unknown future. Communicating clearly with future programmers, including future you. Designed to accommodate change without rewriting. Objectives After today’s class, you should: be able to decompose a recursive problem into recursive steps and base cases know when and how to use helper functions in recursion understand the advantages and disadvantages of recursion vs. iteration Recursion In today’s class, we’re going to talk about how to implement a

related reading

• Reading 11: Recursive Data Typesweb.mit.edu
• CSC 151 - Recursion Over Listseikmeier.sites.grinnell.edu
• How Not to Teach Recursionparentheticallyspeaking.org
• CSC 151 - Recursion over Numberseikmeier.sites.grinnell.edu
• CSC 151 - Tail Recursioneikmeier.sites.grinnell.edu
• Object-Oriented Design and Data Structuresandrewcmyers.github.io
• CSC 151 - Higher-order design, recursive and othereikmeier.sites.grinnell.edu
• CSC 151 - Analyzing procedureseikmeier.sites.grinnell.edu
• Reading 17: Recursive Data Typesweb.mit.edu
• Reading 17: Recursive Data Typesweb.mit.edu
• CSC 151 - Coding Challenge 6eikmeier.sites.grinnell.edu
• Y: The Most Beautiful Idea in Computer Science explained in JavaScriptlucasfcosta.com