GreedyKnapsackFractional (w, v, W)
for i  from 1 to n
    x[i] =0
weight = 0
while weight < W
        i = best remaining item
        IF weight + w[i] ≤ W
            then x[i] = 1
                weight = weight + w[i]
            else
                x[i] = (w - weight) / w[i]
                weight = W
return x