Given a set of activities with specific time period,this algorithm finds the maximum activities that can be performed in that specific time period
Activity # | Start | Finish |
---|---|---|
1 | 18 | 20 |
2 | 19 | 20 |
3 | 20 | 21 |
4 | 22 | 23 |
5 | 18 | 19 |
6 | 19 | 23 |
Maximum Number of Activities : 3 at time 19-20