hi....<br />I am learning Ada in my M.Sc. I am not a regular student.... Its a correspondance course so please help me out...<br />how to find an optimal solution to the Knapsack problem using Greedy method? can u explain me with an example...
</div>
