https://github.com/yorgosbas/activity-selection-algorithm

Given a set of activities with specific time period,this algorithm finds the maximum activities that can be performed
https://github.com/yorgosbas/activity-selection-algorithm

activity activityselectionproblem algorithms problem selection

Last synced: about 2 months ago
JSON representation

Given a set of activities with specific time period,this algorithm finds the maximum activities that can be performed

• Host: GitHub
• URL: https://github.com/yorgosbas/activity-selection-algorithm
• Owner: YorgosBas
• License: mit
• Created: 2019-01-02T11:24:43.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2019-01-16T19:16:20.000Z (over 6 years ago)
• Last Synced: 2023-09-04T20:08:16.968Z (almost 2 years ago)
• Topics: activity, activityselectionproblem, algorithms, problem, selection
• Language: C
• Homepage:
• Size: 11.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Activity Selection Algorithm

Given a set of activities with specific time period,this algorithm finds the maximum activities that can be performed in that specific time period

# Tests

| Activity # | Start | Finish |

| --- | --- | --- |

| 1 | 18 | 20 |

| 2 | 19 | 20 |

| 3 | 20 | 21 |

| 4 | 22 | 23 |

| 5 | 18 | 19 |

| 6 | 19 | 23 |

### Result

`Maximum Number of Activities : 3 at time 19-20`