The A* Search algorithm (pronounced “A star”) is an alternative to the Dijkstra’s Shortest Path algorithm. It is used to find the shortest path between two nodes of a weighted graph. The A* Search algorithm performs better than the Dijkstra’s…

Check this video/animation from Ted Ed to understand what we mean by algothirm and pseudo code. Source: http://ed.ted.com/lessons/your-brain-can-solve-algorithms-david-j-malan#watch