Sign in


An algorithm is intended to accomplish ideal answer for a given issue. In greedy algorithm approach, choices are produced using the given arrangement space. The name itself suggests that the nearest arrangement which gives appearance of ideal arrangement is chosen by this algorithm. Greedy is an algorithmic worldview that develops an answer bit by bit, continually picking the following bit that offers the most self-evident and prompt advantage. A few issues have no productive arrangement; however, a greedy algorithm may give an answer that is near ideal.

Greedy Algorithms have their own advantages and disadvantages . It is…

Mili Sharma