Greedy Algorithms

• 1.1) Greedy Algorithms
  Greedy algorithms are problem-solving techniques that make locally optimal choices at each step with the hope of finding a global optimum (best overall solution). At each decision point, a greedy algorithm selects the best option available at that moment without considering the consequences of that choice on future decisions.