| lab2/part1 | isort: selection sort over a heap array | malloc, free, pointer arithmetic, valgrind | Allocates an int array on the heap, fills it with random(), and sorts ascending and descending through one comparison-parameterised routine. Verified leak-free under valgrind. |
| concepts/memory | manual memory management thread | malloc, free, valgrind, ownership, leaks | Every lab from 2 onward was checked under valgrind and reported zero leaks and zero errors. The linked list library makes ownership explicit: the list stores void pointers and never frees what it did not allocate. |