Skip to content

Latest commit

 

History

History
8 lines (6 loc) · 413 Bytes

File metadata and controls

8 lines (6 loc) · 413 Bytes

DynamicProgrammingInvestmentProblem

Using dynamic programing to compute the maximum returns for a specified investment problem

This software was developed as an assignement for a Data Structures and Algorithms course. The goal was to calculate the maximum returns on the input capital using dynamic programming. Input: investment capital Output: investment split, returns, net profit, Returns on Investment.