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.
-
Updated
Jan 26, 2022 - Python
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.
I had the goal of creating a queue whose performance for both enqueuing and dequeueing would be O(1). To achieve this, instead of using a list, I wrote a dictionary queue structure, DictQueue.
Python Algorithms + Pytest
Introdução à análise de Algoritmo e Big-O
The objective is to build a library to be able to estimate time complexity for machine learning algorithms
Add a description, image, and links to the big-o-performance topic page so that developers can more easily learn about it.
To associate your repository with the big-o-performance topic, visit your repo's landing page and select "manage topics."