Carlos Gutierrez 10570af981 Initial commit: Divide-and-conquer sorting algorithms benchmark ...

- Implement Merge Sort and Quick Sort algorithms with instrumentation
- Add Quick Sort pivot strategies: first, last, median_of_three, random
- Create dataset generators for 5 dataset types (sorted, reverse, random, nearly_sorted, duplicates_heavy)
- Build comprehensive benchmarking CLI with metrics collection
- Add performance measurement (time, memory, comparisons, swaps)
- Configure logging with rotating file handlers
- Generate plots for time and memory vs size
- Include comprehensive test suite with pytest
- Add full documentation in README.md

2025-10-30 21:14:37 -04:00

445 B

Executable File

Raw Permalink Blame History

View Raw