Why might a greedy algorithm fail to find the least cost path in a graph? - Study24x7
Social learning Network
2 followers study24x7 20 Aug 2024 01:08 PM study24x7 study24x7

Why might a greedy algorithm fail to find the least cost path in a graph?

A

Because it makes globally optimal choices at each step

B

Because it makes locally optimal choices without considering the future

C

Because it evaluates every possible path before making a decision

D

Because it uses dynamic programming techniques

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles