API Project 2019 - Politecnico di Milano
This project focuses on implementing data structures and algorithms in C to create a program that executes tasks within strict time and memory limits.
The following table presents the results from the code in this repository that obtained 30 cum laude.
| Problema | Time Limit | Execution Time | Memory Limit | Memory Used |
|---|---|---|---|---|
| Monotone | 4,320 s | 1,837 s | 200 MiB | 161 MiB |
| DropOff | 6,963 s | 2,774 s | 190 MiB | 164 MiB |
| MixUp | 0,610 s | 0,208 s | 6,00 MiB | 2,52 MiB |
| Repeated | 1,139 s | 0,367 s | 9,00 MiB | 3,77 MiB |
| MultipleMixUp | 3,062 s | 0,816 s | 20,0 MiB | 15,5 MiB |
| MultipleRepeated | 5,340 s | 1,428 s | 35,0 MiB | 28,8 MiB |
| Lode | 1,640 s | 0,872 s | 23,0 MiB | 16,8 MiB |
- Arrays
- Red-Black trees (Cormen)
- Binary search over ordered arrays