Optimal Binary Search Trees: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
* https://www.coursera.org/learn/algorithms-greedy/lecture/rUDLu/optimal-substructure | * https://www.coursera.org/learn/algorithms-greedy/lecture/rUDLu/optimal-substructure | ||
* https://www.coursera.org/learn/algorithms-greedy/lecture/0qjbs/proof-of-optimal-substructure | * https://www.coursera.org/learn/algorithms-greedy/lecture/0qjbs/proof-of-optimal-substructure | ||
* https://www.coursera.org/learn/algorithms-greedy/lecture/3wrTN/a-dynamic-programming-algorithm-i | |||
* https://www.coursera.org/learn/algorithms-greedy/lecture/5ERYG/a-dynamic-programming-algorithm-ii | |||
=Internal= | =Internal= | ||
Revision as of 19:19, 28 October 2021
External
- https://www.coursera.org/learn/algorithms-greedy/lecture/GKCeN/problem-definition
- https://www.coursera.org/learn/algorithms-greedy/lecture/rUDLu/optimal-substructure
- https://www.coursera.org/learn/algorithms-greedy/lecture/0qjbs/proof-of-optimal-substructure
- https://www.coursera.org/learn/algorithms-greedy/lecture/3wrTN/a-dynamic-programming-algorithm-i
- https://www.coursera.org/learn/algorithms-greedy/lecture/5ERYG/a-dynamic-programming-algorithm-ii