Tutorial by Topics: greedy

QuantifiersDescription?Match the preceding character or subexpression 0 or 1 times (preferably 1).*Match the preceding character or subexpression 0 or more times (as many as possible).+Match the preceding character or subexpression 1 or more times (as many as possible).{n}Match the preceding chara...

A greedy algorithm is an algorithm in which in each step we choose the most beneficial option in every step without looking into the future. The choice depends only on current profit. Greedy approach is usually a good approach when each profit can be picked up in every step, so no choice blocks ...

Sources The examples above are from lecture notes frome a lecture which was taught 2008 in Bonn, Germany. They in term are based on the book Algorithm Design by Jon Kleinberg and Eva Tardos: