Week 5 Discussion Forum

specification of greedy algorithm

specification of greedy algorithm

by MD.Munim Shariair Galib -
Number of replies: 0

Some advantages of Greedy Algorithm :

  • Always taking the best available choice is usually easy. It usually requires sorting the choices.

  • Repeatedly taking the next available best choice is usually linear work. But don't forget the cost of sorting the choices.

  • Much cheaper than exhaustive search. Much cheaper than most other algorithms.


51 words