👍This project aims to be a finest hub of various data structures and algorithms using python. Feel free to contribute and show your support by ✨ this repository.
:red_circle: Issue Name : Activity Selection Problem [Directory : Greedy Approach]
[x] Hacktoberfest2022 Participant
[x] Contributor
Closes: #204
Description :
Created a Python script using the Greedy method to find out the maximum activities to be done by a person, assuming that a person can only work on a single activity at a time.
Type of change
What sort of change have you made:
[ ] Bug fix (non-breaking change which fixes an issue)
[x] New feature (non-breaking change which adds functionality)
[ ] Code style update (formatting, local variables)
[ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
[ ] This change requires a documentation update
How Has This Been Tested?
This script or code has been tested using various test cases and scenarios.
Checklist:
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code, particularly whereever it was hard to understand.
[x] I have made corresponding changes to the documentation.
[x] My changes generate no new warnings.
[x] I have added test cases that prove my fix is effective or that my feature works.
Related Issue #204
:red_circle: Issue Name : Activity Selection Problem [Directory : Greedy Approach]
Closes: #204
Description :
Created a Python script using the Greedy method to find out the maximum activities to be done by a person, assuming that a person can only work on a single activity at a time.
Type of change
What sort of change have you made:
How Has This Been Tested?
This script or code has been tested using various test cases and scenarios.
Checklist: