Activity Selection Problem - Java | Algorithms
The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi). The problem is to select the maximum number of activities that can be performed by a single person or machine, assuming that a person can only work on a single activity at a time.Given Activities: [[1, 3], [2, 5], [0, 7], [6, 8], [9, 11], [10, 12]] Selected Activities: [1, 3] [6, 8] [9, 11]