Stop when the knapsack is full.

This greedy strategy ensures the maximum value is achieved.

Pseudocode

FractionalKnapsack(W, weights, values, n)
    Initialize A ← [0, 0, ..., 0]  // To store fractions of items taken
    Initialize V ← 0              // Total value accumulated
 
    Compute value-to-weight ratio for each item:
        ratio[i] ← values[i] / weights[i] for i = 1 to n
    
    Sort items by ratio[i] in descending order
 
    for i = 1 to n:
        if W == 0:
            return (V, A)         // If capacity is exhausted, return value and fractions

Related Tags