Apna Kahuta

cs502 Graded Discussion Board (GDB) will be launched on Feb 11, 2013 and it will remain open till Feb 12, 2013

VU Students Corner

Dear Students!

Graded Discussion Board (GDB) will be launched on Feb 11, 2013 and it will remain open till Feb 12, 2013.

Topic:

A “greedy algorithm” always works well for optimization problems. Support or contradict this statement with solid arguments.
  
Note:
 A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 5-7 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered. Any request about such an acceptance will not be catered.

5 comments :

:)) ;)) ;;) :D ;) :p :(( :) :( :X =(( :-o :-/ :-* :| 8-} :)] ~x( :-t b-( :-L x( =))
  1. Greedy algorithms are simple and straightforward. They are shortsighted in their approach in the sense that they take decisions on the basis of information at hand without worrying about the effect these decisions may have in the future. They are easy to invent, easy to implement and most of the time quite efficient. Many problems cannot be solved correctly by greedy approach. Greedy algorithms are used to solve optimization problems

    ReplyDelete
    Replies
    1. thanksssssssssss for sharing

      Delete
  2. Greedy Approach
    Greedy Algorithm works by making the decision that seems most promising at any moment; it never reconsiders this decision, whatever situation may arise later.

    ReplyDelete

Add you Comment


Get Adminship and Make Posts For News/Info/Fun on Our Blog,