Problem Solving Flashcards
1
Q
Greedy Algorithm
A
a type of algorithm that solves the problem by making an optimal choice in the current situation to solve the problem
2
Q
greedy choice
A
the best, or optimal choice that solves the subproblem
3
Q
subproblem
A
a similar problem of smaller size
4
Q
safe move
A
a greedy choice where there is an optimal solution consistent with its first move
5
Q
Divide & Conquer Algorithm
A
a type of algorithm that tackles several small problems to solve a larger problem
6
Q
Dynamic Programming
A
a method of solving complex problems, where the problem is broken down into subproblems. Those subproblems are individually solved, ONCE. Then, their results are stored.
7
Q
Brute Force
A
The simplest way of solving a problem, it relies on the computer’s speed to solve the problem
