Posted on Mon Dec 15 2025 00:00:00 GMT+0000 (Coordinated Universal Time)

Greedy Algorithms

Greedy algorithms is a problem-solving paradigm group of algorithms that takes the locally optimal choice at each step, without revisiting past decisions.

Usually O(n) or O(nlogn), simple to implement, rely on sorting, priority queues, or linear scans.