In a nutshell
A greedy algorithm builds its answer by always taking the choice that looks best right now and never going back to revise it. That only reaches the true best answer for special problems — activity selection is one: sort the activities by when they finish, then keep grabbing the earliest-ending one that doesn't overlap your last pick, and you fit the most activities possible.