Skip to content

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

License

Notifications You must be signed in to change notification settings

barianos/DynamicProgrammingInvestmentProblem

Repository files navigation

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.

About

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

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages