AUD-23-Student-Solutions

This repository is a collection of homework solutions from SoSe 23.

• P0: Fibonacci – iteration vs recursion (2/2p)

T1: Tower of Hanoi (6/6p)

• P1: sorting algorithms (27/30p)
• P2: Btrfs operations (11,5/12/30p)
• P3: Kruskal & Dijkstra (30/30p)

The projects are organized in a single repository but maintain their individual Git histories.

Running Public Tests

To run the public tests for each homework assignment, you need to navigate to the respective subtree repository directory.

License

This project is licensed under the MIT License. Feel free to use the code in this repository for personal or educational purposes.