Fractional knapsack for report
A draft report has five chapters. The table shows the lengths of the chapters & their importance where the scale is from 1(low) to 10(high). The report must be at most 600 pages long. The problem is to edit the report so that the overall importance is maximized. Implement the fractional knapsack algorithm using Greedy Programming.
| Chapter | Pages | Importance |
| 1 | 120 | 5 |
| 2 | 150 | 5 |
| 3 | 200 | 4 |
| 4 | 150 | 8 |
| 5 | 140 | 3 |