Summary
- Greedy Algorithms: Useful for optimization problems where local decisions lead to a globally optimal solution, though not always guaranteed.
- Knapsack Problem: Solved by taking items based on the highest value-to-weight ratio.
- Job Sequencing: Tasks are selected based on profit, and jobs are allocated to available time slots without exceeding their deadlines.