Metadata-Version: 1.2
Name: Intrst-algrms
Version: 0.1.1
Summary: https://intrst-algrms.readthedocs.io/en/latest/
Home-page: https://intrst-algrms.readthedocs.io/en/latest/
Author: Nikolai Vidov
Author-email: lastsal@mail.ru
License: MIT
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
        
        ```
        git clone git@github.com:Niccolum/intrst_algrms.git .
        ```
        More detailed description and HOW-TO - located in the readme file in each of the folders
        
        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
Keywords: example documentation algorithms
Platform: UNKNOWN
Requires-Python: >=3.6
