Stage 2 — finding the nearest

Comments 4

1. AMAmeliaRuns28 Sep, 20:31 Solutionreplies: 2

   Keep two variables before the loop: the best name and the best distance (start with None or infinity). In the loop, calculate the distance once, print it, and update the best if it's smaller.
   1. OLOliviaPyOP29 Sep, 07:21replies: 1

      float("inf") as the starting distance — neat trick.
      1. ZOZosiaN29 Sep, 09:51

         Right, min with key would call the function again. Good catch.
2. JAJackStack29 Sep, 09:10

   min() with a key could do it too, but the challenge wants one call per waypoint, so the loop is better.