Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a specialized algorithmic approach in this 24-minute conference presentation that examines bottom-up computation techniques for functions operating on lists. Learn how to transform top-down problem specifications that may repeatedly compute sub-problems into efficient bottom-up algorithms that store and reuse solutions in tables. Discover the mathematical foundations behind Richard Bird's 2008 algorithm for computing functions where the output depends on all immediate sublists of the input. Understand the key property that enables this algorithm to work effectively and examine how it constructs trees with specific shapes where sizes along the left spine form prefixes of Pascal's triangle diagonals. Master the crucial transformation function that converts one diagonal to the next, providing insight into the elegant mathematical structure underlying this computational approach. Gain theoretical knowledge applicable to functional programming and algorithm design, particularly for problems involving list processing and dynamic programming optimization.
