# Greedy Algorithms An algorithm is **greedy** when the path and/or solution picked is regarded as the best option, based on a specific set of criteria, without considering the big picture (called a *greedy choice*). These algorithms will *produce a locally optimal solution* that may or may not lead to a globally optimal solution. This is achieved by making greedy choices, orthe best choice at the current moment, and It’s still possible for some greedy algorithms to guarantee an optimal solution. ## Common Design Ideologies