This animation walks through computing fib(5) two ways: plain recursion, which redraws a branching call tree full of repeated subcalls, and dynamic programming, which stores each result in an array or memo table so every value is computed once. Side-by-side visuals of the recursion tree and the growing table make the wasted work and the savings obvious. Built for B.Tech second and third year students studying algorithms, recursion, and time complexity.
Narrated · 9:16 · Preview before teaching · automatic layout checks do not establish subject accuracy
Create a high-quality educational animated reel in 9:16 vertical format explaining Dynamic Programming using the Fibonacci recursive function. Use a modern 2D computer-science visualization style with a dark background, bright readable text, smooth animations, and vector graphics. Keep the animation stable and avoid excessive visual effects. All code, stack frames, tree nodes, and array elements must remain clearly readable. Explain with fib(5) as shown in the uploaded image. Audience: B.Tech. 2nd and 3rd year students