Understanding Mit 6 006 Fall 2011 Recitation 19
Exploring Mit 6 006 Fall 2011 Recitation 19 reveals several interesting facts. Dynamic programming; using graph search to visualize dynamic programming problems; shortest-paths in directed acyclic graphs ...
Key Takeaways about Mit 6 006 Fall 2011 Recitation 19
- Recursion trees for analyzing the asymptotic running time of an algorithm; data structure analysis (binary search trees, heaps) ...
- Dynamic programming: solving the perfect information Blackjack problem as a graph search problem and with dynamic ...
- Lecture
- Balanced binary search trees, AVL (Adelson-Velskii-Landis) trees 6.006 on OCW: ...
- Shortest-path algorithms in graphs; solving problems by reducing them to shortest-path searches 6.006 on OCW: ...
Detailed Analysis of Mit 6 006 Fall 2011 Recitation 19
Dynamic programming: technique overview, computing Fibonacci numbers, memoization, dynamic programming as ... Sorting, with an emphasis on radix sort + counting sort 6.006 on OCW: ... Problem Set 3: line-sweep algorithms; problem set code walk-through 6.006 on OCW: ...
Dynamic programming: computing an optimal paranthesization (evaluation of an associative expression, e.g. matrix multiplication) ...
Stay tuned for more updates related to Mit 6 006 Fall 2011 Recitation 19.