Add activity selection new algorithm #11667
Open
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Describe your change:
The Activity Selection Problem is a classic greedy algorithm problem. Given a list of activities, each with a start and end time, the goal is to select the maximum number of non-overlapping activities that can be performed. The solution involves sorting the activities by their end times and then greedily selecting the first activity that finishes the earliest, ensuring no subsequent activity overlaps with the previously selected one.
This approach ensures an optimal solution by always prioritizing the earliest finishing activities, which leaves the most room for future activities.
Checklist: