https://intrst-algrms.readthedocs.io/en/latest/
Project description
# 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 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](https://github.com/rkern/line_profiler#installation)
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)](binary_tree/results.md) * [Knapsack problem](knapsack_problem/results.md) * [Unpacking nested lists of indefinite depth](unpacking_flatten_lists/results.md)
More, about funcs, in [docs](docs/build/html/index.html)
## Contributing
Please read [CONTRIBUTING.md](CONTRIBUTING.md) for details on our code of conduct, and the process for submitting pull requests to us.
## Authors
Nikolai Vidov - maintainer - [Niccolum](https://github.com/Niccolum)
## License
This project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.