Pascal273 / 7th-Project-Solve-Problems-Using-Algorithms

Deconstruction of a computational problem... 3 algorithms to find the best possible combination of shares for investors (based on list of shares) while making use of dynamic programming.

Repository from Github https://github.comPascal273/7th-Project-Solve-Problems-Using-AlgorithmsRepository from Github https://github.comPascal273/7th-Project-Solve-Problems-Using-Algorithms

Introduction

This is the 7th project for the Python path of Openclassrooms. The goal is to design two algorithms that will maximize clients profits after two years of investment:

  • Bruteforce version
  • Optimized version

The algorithms must suggest a list of the most profit-yielding shares we should buy while it complies with the following limitations:

  • Each share can only be bought once.
  • We cannot buy a fraction of a share.
  • We can spend at most 500 euros per client.

Required Setup to run the program:

  1. Python version 3.9.5 or higher must be installed.

How to run the program:

  1. Open your terminal
  2. Navigate to the directory that contains the main.py
  3. Run the command: python main.py
  4. Follow the instructions

Notes

  • The program will create folders and files automatically

Technologies

  • Python version 3.9.5

About

Deconstruction of a computational problem... 3 algorithms to find the best possible combination of shares for investors (based on list of shares) while making use of dynamic programming.


Languages

Language:Python 100.0%