How luna-caty/sorting-algorithms works
Project type and purpose
• This is a small, monolithic C command-line benchmarking tool whose sole purpose is to implement six sorting algorithms, measure their execution time on arrays of various sizes, and emit comparative results (sorting.csv and charts).
File structure
• README.md ← project description and charts
• main.C ← single source file housing:
• array generator (for sizes 50, 100, 200, …)
• six sorting functions (Bubble, Optimized Bubble, Gnome, Radix, Quick, Heap)
• timing harness (using a high-resolution clock)
• CSV logger (writes size, algorithm name, duration)
• main.exe ← compiled executable (build artifact)
• sorting.csv ← output data file consumed by charts
README for additional insights
• Confirms the six algorithms and the test sizes
• Shows static chart images (created after CSV is generated)
Detailed elements
• Blue for computation modules (sorting functions)
• Green for utility modules (Timer, CSV Writer)
• Gray for data artifacts (sorting.csv, charts)