How mdismail-nub/greedy works
This is a small C++ greedy-algorithm learning repository, not a deployed application. The available tree contains two standalone console solutions: fractional knapsack and job sequencing. Each reads problem data, applies its greedy strategy, and reports a result. The README describes a broader planned collection, but those other problem modules are not present in the supplied tree, so they are not represented as implemented components.
Main entry points: Fractional Knapsack/Solution.cpp Knapsack console · Job_sequencing/Solution.cpp Job console
Components 5
Fractional Knapsack
- Knapsack console
Fractional Knapsack/Solution.cpp - Value ratio selection
Fractional Knapsack/Solution.cpp
Job Sequencing
- Job console
Job_sequencing/Solution.cpp - Deadline scheduling
Job_sequencing/Solution.cpp
Other components
- Console user
Connections 7
- Console user → Knapsack console: enters items
Fractional Knapsack/Solution.cpp - Knapsack console → Value ratio selection: calls
Fractional Knapsack/Solution.cpp - Value ratio selection → Knapsack console: returns value
Fractional Knapsack/Solution.cpp - Knapsack console → Console user: prints result
Fractional Knapsack/Solution.cpp - Console user → Job console: enters jobs
Job_sequencing/Solution.cpp - Job console → Deadline scheduling: calls
Job_sequencing/Solution.cpp - Deadline scheduling → Console user: prints totals
Job_sequencing/Solution.cpp