5.08 Limits of Algorithms

5.8 Limits of Algorithms Curriculum Page

POGIL Worksheet: https://docs.google.com/document/d/1Qq5RGIQEMdk8mM6LSHBAxujtjfVj-WLGoIL-poQI9dI/edit?usp=sharing

Limits of Algorithms: https://docs.google.com/document/d/1kOSrcFVzRKTEPI4w24FJc2nFQ8BVt2K9zDBthf44L24/edit?usp=sharing

1. Starting and ending at Trinity College, what route would the nearest neighbor heuristic produce for the proposed visits?

The route would be A, B, C.

2. Starting and ending at Trinity College, find the optimal route that visits all schools. (HINT: To prove that your route is optimal, you'll have to compare it to all possible routes starting and ending at Trinity.)

The best route to take is B, C, A because it is 7.6 miles long which is the shortest route possible.

3. (Portfolio) For routes starting and ending at Trinity College, you have identified the nearest neighbor route and the optimal route. What does this show you about the nearest neighbor heuristic?

The nearest neighbor heuristic is not always the optimal route to take; sometimes it is better to not go to the nearest neighbor if you have many different places to go to.