This project implements (or will - over time - implement) various algorithms in C# in order to study and use them.
Currently, the library consists only of a handful of algorithms and data structures.
- Quickselect
- Binary Tree
- In-, Level-, Pre- and Post-Order Traversals
- Recursive In-, Pre- and Post-Order Traversals
- Min Heap and Max Heap
The project is licensed under the EUPL v.1.1, a copy of which can be found in LICENSE.md.