Week 5 Discussion Forum

Specifications of Greedy Algorithm

Re: Specifications of Greedy Algorithm

by Abdulla Al Moin 192-15-2838 -
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