This repository contains implementations of various algorithms and data structures developed by Kacper Górski and Maciej Cieślik for computational complexity analysis. 📊
This folder contains implementations of various tree data structures, such as binary search trees (BST) and AVL trees. 🌲
This folder contains implementations of heap algorithms. 🔧
This folder contains implementations of various sorting algorithms, such as bubble sort, insertion sort, selection sort, quicksort, and mergesort. 🧮
This folder contains the implementation of Dijkstra's algorithm for finding the shortest path in a graph. 🗺️
This folder contains implementations of Turing machines and exemplary programs based on Turing machines. 🧩
The repository is maintained by Kacper Górski and Maciej Cieślik, who are computer science students at the Faculty of Electronics and Information Technology at the Warsaw University of Technology. Their interests include algorithms, data structures, and computational theory. 🌟