ProblemSolvingParadigms

Problem-Solving Paradigms

These are general approaches to designing algorithms.

Complete Search (Brute Force)

• Backtracking
• Exhaustive Search on The Algorithmist

Divide and Conquer (applications of Binary Search)

• Divide and Conquer algorithm
• Binary Search

Greedy Algorithms

• Greedy Algorithms on The Algorithmist

Dynamic Programming

Nota Bene Dynamic Programming will be applicable to almost all ACM ICPC problems!!

• Longest Increasing Subsequence
• Making Change
• Knapsack
• Maximum Weighed Independent Set
• (many more...)
• (even more...)