Link to quiz:

https://www.codecademy.com/courses/learn-data-structures-and-algorithms-with-python/quizzes/astar-conceptual-qz

Why is this wrong:

?

Link to quiz:

https://www.codecademy.com/courses/learn-data-structures-and-algorithms-with-python/quizzes/astar-conceptual-qz

Why is this wrong:

?

Because it’s not the correct answer. Look up the definition of a greedy algorithm if the implication from the explanation has caused you frustration. Dijkstra’s algorithm does not optimize at every move.

3 Likes

Why did the course put the Dijkstra’s algorithm in the topic of greedy algorithms?

1 Like

That’s a good question. Learning Dijkstra’s algorithm is a precursor to learning A* which is greedy, but I can’t answer why the course is organized the way it is.

2 Likes