Learn how to implement recursion in data structures and algorithms with these best practices, such as choosing the right base case, avoiding unnecessary work, testing and debugging, and more.

Recursion can be elegant and concise, as it often follows the natural structure of the problem and the data. Recursion can also handle variable depth and complexity of composite structures, as it ...

Recursion Over Lists and Other Data Structures [ This section is a little out of place--need to introduce type and equality predicates first! Those have been presented in class, so this should be ...

This paper describes a pseudo-linear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex recursive data structures. Our type system can encode ...

A study is made of the problem of estimating interference in an imperative language with dynamic data structures. The authors focus on developing efficient and implementable methods for recursive data ...