ll.c: A simple implementation of reversing a singly linked list
Building and Testing
To build the code, all you'll need is make and gcc. To build and test from scratch, simply type make test.
All tests within tests.c will be run. This file has a simple main function and is linked with the ll.c source at build time.
There's also a simple GitHub Action workflow file included, which will automatically check out and build the code by running make test.
Modifying
To add new functionality, simply edit ll.h with your prototypes, and ll.c with your implementations. Then, to add tests, write test code in tests.c and execute it with make test
A simple vim session is provided, and can be used to edit ll.c, ll.h, and tests.c by running vim -S ll.vim
Features
- a simple implementation that prioritizes readability over terseness
- a three-pointer iterative approach to reversing the linked list
- minimal but complete environment, with separation of implementation and tests
- fully stack-based memory management, so you don't have to worry about debugging memory allocations
- built to be able to use heap memory if that's something you want to practice