Algorithm Strategies

Question 1

Dynamic Algorithm

Answer 1

store Fibonacci answers so they can be used later.

Question 2

Greedy Algorithm

Answer 2

trying the best current (local) choice whenever an algorithm has multiple options it can select from

Question 3

Brute-Force Algorithm

Answer 3

trying all of the possible paths to find the shortest path

Question 4

Branch and bound

Answer 4

keep track of the cheapest path. Ignore choices that cost more.

Question 5

Heuristic Algorithm

Answer 5

Rule of Thumb

Question 6

Backtracking Algorithm

Answer 6

tries all of the possible paths by using recursive calls and if it finds the desired path, the recursive calls stop. It uses depth-first search.