feat: Add Job Sequencing Algorithm in C++ #2882
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- Implemented the Job Sequencing Algorithm using a greedy approach to maximize profit by scheduling jobs within their respective deadlines.
- Added `jobSequencing()` function which takes an array of jobs (each with an ID, deadline, and profit) and schedules them based on highest profit within the available deadlines.
- The algorithm sorts jobs by profit and iteratively assigns them to the latest available slots, aiming to maximize the total profit.
- Included comments to explain the structure of the algorithm, sorting, and scheduling logic for clarity.
Example Input:
Jobs = { {'a', 2, 100}, {'b', 1, 19}, {'c', 2, 27}, {'d', 1, 25}, {'e', 3, 15} }
Expected Output:
Job sequence for maximum profit: a c e
Total Profit: 142
This implementation improves the repository by adding an essential scheduling algorithm, providing learners with a practical example of greedy algorithms in C++.
sneha0099
requested review from
Panquesito7 and
realstealthninja
as code owners
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
github-actions
bot
added
the
stale
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Description of Change
Closes #2881
Implemented the Job Sequencing Algorithm using a greedy approach to maximize profit by scheduling jobs within their respective deadlines. The
jobSequencing()function arranges jobs based on the highest profit within the available time slots. Example input and expected output have been included in comments for clarity.Checklist
Notes:
This PR adds the Job Sequencing Algorithm, which is an essential greedy algorithm for maximizing profit from job scheduling.