Logic and programming

Analysis of Algorithms/Dynamic Programming/Greedy Algorithm

Project description
1. Write a program using dynamic programming for the formula

Combin(n,m) = Combin(n-1,m-1)+Combin(n-1,m)

where Combin(0,0)=1, Combin(n,m)=1 if n<=m

2. Using the greedy algorithm to solve the following packing problem:

The container space is 20 in length . We have 8 items having the lengths: 15,10,12,4,6,8,2,1.

TAKE ADVANTAGE OF OUR PROMOTIONAL DISCOUNT DISPLAYED ON THE WEBSITE AND GET A DISCOUNT FOR YOUR PAPER NOW!