Quicksort Algorithm implementation on linked lists with C. It takes a list, and returns the list in sorted sequence. Only pointers are changed, no new nodes are allocated and no key values are moved to different nodes.
Aufuray/quicksort-on-linkedlist
Quicksort implementation on linked lists with C. It takes a list, and returns the list in sorted sequence. Only pointers are changes, no new nodes are allocated and no key values are moved to different nodes.
CGPL-2.0