|
C Fundamentals
Algorithms · data structures · cryptography · systems — pure C11, zero deps
|
Files | |
| benchmark.c | |
| Empirical comparison of all five sort algorithms. | |
| bubble_sort.c | |
| Bubble sort with early-exit optimization. | |
| heap_sort.c | |
| In-place heap sort. O(n log n) worst case, O(1) auxiliary memory. | |
| insertion_sort.c | |
| Insertion sort — stable, O(n²) worst, O(n) on nearly-sorted input. | |
| main.c | |
| Sorting CLI — pick an algorithm, sort either argv or stdin. | |
| merge_sort.c | |
| Top-down merge sort with explicit auxiliary buffer. | |
| quicksort.c | |
| Quicksort using Lomuto partition. | |
| radix_sort.c | |
| LSD radix sort for non-negative ints, byte-by-byte. | |
| selection_sort.c | |
| Implementation of selection sort algorithm. | |
| sorts.h | |
| Unified header for all sorting algorithms. | |