Worst Case for this greedy algorithm:
2n items with weigth K, K/n, K, K/n......

The optimal solution C* would use n+1 trucks.
However, the greedy algorithm given will have to load every item into a new truck, hence the
solution C produced by it will use 2n trucks. As n approaches infinity,  C/C* approximation
ratio approaches 2.