Project regarding greedy Algorithms

Using a random number generator, generate 100 possible items for the basket. The items should have random weights between 1 and 600. Use the dynamic programming algorithm to compute the exact optimal solution for the set of 100 items. Note that the solution is a weight, wj, where 0 < wj <= 1000. Use the greedy approximation algorithm to compute an approximate solution using the same set of items. Run this set of steps 10 times, keeping track of the high, low and average values. Also, keep track of the running times for both algorithms.