19. Dynamic Programming I: Fibonacci, Shortest Paths

19. Dynamic Programming I: Fibonacci, Shortest Paths

begin-post-stats

MIT OpenCourseWare • 729K views

end-post-stats begin-duration 51:47 end-duration
Math topics:
_Theoretical_computer_science_##Theoretical computer science##_Recursion_##Recursion##_Recursion_(computer_science)_##Recursion (computer science)##_Time_complexity_##Time complexity##_Algorithm_##Algorithm##_Golden_ratio_##Golden ratio##_Fibonacci_number_##Fibonacci number##_Golden_ratio_##Golden ratio##_Fibonacci_##Fibonacci
Other topics:
_Systems_science_##Systems science##_Richard_E._Bellman_##Richard E. Bellman##_Dynamic_programming_##Dynamic programming##_Subroutine_##Subroutine##_Computing_##Computing##_Top-down_and_bottom-up_design_##Top-down and bottom-up design##_Lookup_table_##Lookup table##_Memoization_##Memoization##_Computational_problems_in_graph_theory_##Computational problems in graph theory##_Depth-first_search_##Depth-first search##_Topological_sorting_##Topological sorting##_Shortest_path_problem_##Shortest path problem
video-id: OQ5jsbhAv_M channel_MIT_OpenCourseWare_