Intrst-algrms 0.1.25

https://intrst-algrms.readthedocs.io/en/latest/

Instruments and algorithms

Here is examples of realizations several algorithms, they performance, memory used and result plots.

Getting Started

Requirements

Python 3.6+ (because of type checking)

Installing

python3 -m venv env
source env/bin/activate

For check and research you must do:

pip install -e git+https://github.com/Niccolum/intrst_algrms#egg=Intrst_algrms
cd env/src/intrst_algrms

Note:

For check memory tests - install line_profiler manually. This package not include to install because of problem with installation. Details here

After that you can run commands from results.md on each folders.

More detailed description and HOW-TO:

Results of research algorithms here:

• Binary Tree (sorting)
• Knapsack problem
• Unpacking nested lists of indefinite depth

For use funcs in your own code you can install package from PYPI:

pip install Intrst_algrms

and import it from your code:

from binary_tree.funcs import ...
from knapsack_problem.funcs import ...
from unpacking_flatten_lists.funcs import ...

More, about funcs, in docs

Contributing

Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests to us.

Dev

For developers info here.

Authors

• Nikolai Vidov - maintainer - Niccolum

License

This project is licensed under the MIT License - see the LICENSE.md file for details