title: What are the differences between Nearest Neighbor Algorithm and Greedy Algorithm?
body: <p>I'm trying to develop 2 different algorithms for Travelling Salesman Algorithm (TSP) which are Nearest Neighbor and Greedy. I can't figure out the differences between them while thinking about cities. </p>
  
  <p>I think they will follow the same way because shortest path between two cities is greedy and the nearest at the same time. which part am i wrong? Can you explain with a few cities example thank you!</p>