+A greedy algorithm constructs a solution step-by-step, always choosing the immediate best option without reevaluating past choices. It aims for a local optimum, hoping this path ultimately leads to a global optimum for the entire problem, a foundational strategy in [Algorithm](/wiki/algorithm) design and [Optimization](/wiki/optimization). Though simple, its direct choices don't always guarantee the best overall result.
+## See also
+- [Dynamic Programming](/wiki/dynamic_programming)
+- [Approximation Algorithm](/wiki/approximation_algorithm)
+- [Heuristic](/wiki/heuristic)