Consider that you have n events with their start and finish time, the objective is to find solution set having maximum number of non-conflicting events that can be conducted in a single time frame, assuming that only one auditorum or hall is available for conducting.
-
Notifications
You must be signed in to change notification settings - Fork 2
In this project we saw about the greedy approach and how efficient it is in solving real life problems. Then we had a glance on its advantages and disadvantages which simply includes the easiness in its implementation and the statement that “ it does not guarantees optimal solution in every case"
theritik01/TASK-SCHEDULER
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
In this project we saw about the greedy approach and how efficient it is in solving real life problems. Then we had a glance on its advantages and disadvantages which simply includes the easiness in its implementation and the statement that “ it does not guarantees optimal solution in every case"
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published