= Lecture 15: Recursive Algorithms (6.006 Spring 2020) by Massachusetts Institute of Technology, 6.006 course staff
{c}
{tag=Work by Massachusetts Institute of Technology, 6.006 course staff}
By <Massachusetts Institute of Technology, 6.006 course staff>.
Publisher: MIT OpenCourseWare, Massachusetts Institute of Technology.
This source is credited to an organization.
Online text: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/9eb3e9a51a7b5b60b0f67c2277f8b0ee_MIT6_006S20_lec15.pdf
Spring 2020 identifies the MIT 6.006 course offering. The institutional credit applies to these notes; listed course instructors are not inferred to be their authors.
Cited passages: MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed p. 3, final three bullets: growing Fibonacci bit lengths and addition cost; MIT 6.006 Spring 2020, Lecture 15: Recursive Algorithms, printed pp. 2–3, Fibonacci Numbers and Re-using Subproblem Solutions.
Back to article page
