Activity Selection Problem

Chooses the maximum number of activities that do not overlap by always picking the next activity that finishes earliest.