Divide and Conquer
Splitting a problem, solving the parts, combining the answers.
1 subject · 2 topics · 1 cheatsheet
Subjects covering this category
1 subject- Subject · Intermediate to Advanced
Tracing, implementing and proving the cost of the classic searching, sorting and graph algorithms, and designing new ones with divide and conquer, backtracking, greedy choice and dynamic programming, in Python, Java and TypeScript.
- Searching and Simple Sorting
- Efficient Sorting
- Design Strategies
Cheatsheets
1 cheatsheet- Cheatsheet · Algorithms
Every sort the subject teaches beyond the simple three on one page: what each costs, what it needs, and which one to call.
In Divide and Conquer itself
2 topics- Algorithms
Divide and conquer: designing an algorithm by splitting a problem, solving the parts recursively and combining them, then reading its cost from a recurrence.
Intermediate to Advanced8 cards · 4 qnot started
- Algorithms
Choosing between divide and conquer, dynamic programming, greedy and backtracking in algorithms, by how a problem's subproblems behave.
Intermediate to Advanced7 cards · 3 qnot started