Category Archives: Greedy

Activity Selection Problem

Problem : You are given n activities with their start and finish times. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time. This is the most basic example of Greedy Approach. Greedy Choice Property: Pick/select the activity whose… Read More »