A

Admin • 833K Points
Coach

Q. Dijkstra’s Algorithm is the prime example for

  • (A) greedy algorithm
  • (B) branch and bound
  • (C) back tracking
  • (D) dynamic programming

Explanation by: Admin

dijkstra’s algorithm is the prime example for greedy algorithms because greedy algorithms generally solve a problem in stages by doing what appears to be the best thing at each stage.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.