Course page Home page Home page CoursesNew course

Recursion, backtracking, and dynamic programming: Computer Science course | Zoonk

25. Recursion, backtracking, and dynamic programming

Solve problems by calling a function on smaller versions of the same problem, trying choices systematically, and storing repeated subproblem results. This chapter covers recursion, backtracking, memoization, and dynamic programming through concrete coding tasks.

Computer Science

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc