/ands

Algorithms and data structures for educational, demonstrational and experimental purposes.

Primary LanguagePythonMIT LicenseMIT

Algorithms and Data Structures (ands)

Python 3.9+ Packagist

Introduction

ands stands for algorithms and data structures.

So, in this repository, you can find some of the most common algorithms and data structures studied in Computer Science, such as quick-sort or binary-search trees. The algorithms are divided into main categories, such as sorting algorithms or dynamic programming algorithms.

The current main goal of this project is for me to learn more about new algorithms and data structures, but I hope these implementations can also be useful to anyone interested in them.

Development

I use

  • poetry for development
  • pyenv to manage Python versions
  • the Makefile to declare common commands

For more info about how to develop, see ./docs/dev/how_to_develop.md.

How to install?

To install this package, you can use

poetry install

Documentation

Most modules and functions have been thoroughly documented, so the best way to learn about the algorithms and data structures is to read the source code and the related docstrings and comments.

You can find more documentation under docs. There you will find the history of the project, development conventions that should be adapted, etc.