📄️ Algorithmic Paradigms
Brute Force
📄️ Sorting Algorithms
What is sorting?
📄️ Searching Algorithms
Brute force: linear search
📄️ Challenges on sorting and searching
Challenge 1: Find two numbers that add up to "n"
📄️ Graph Algorithms
What is a graph ?
📄️ 贪心算法
- 背包分装问题
📄️ 动态规划 Dynamic Programming
Most problems that can be solved with dynamic programming can also be solved with a divide and conquer approach. The difference between the two is that the dynamic programming approach is applicable when a problem has overlapping subproblems;