Initial commit: Heapsort and Priority Queue Implementation

- Implemented complete Heapsort algorithm with max-heap operations - Implemented binary heap-based Priority Queue with all core operations - Created Task class for task scheduling applications - Implemented Task Scheduler simulation using priority queue - Added comprehensive test suite (70+ tests, all passing) - Implemented sorting algorithm comparison utilities (Heapsort vs Quicksort vs Merge Sort) - Added detailed README with comprehensive analysis and documentation - Included demonstration scripts for all features - Generated performance comparison plots - Modular, well-documented code following academic standards Author: Carlos Gutierrez Email: cgutierrez44833@ucumberlands.edu
2025-11-09 21:54:13 -05:00
commit c1b0fd3aaf
26 changed files with 3552 additions and 0 deletions
--- a/docs/.gitkeep
+++ b/docs/.gitkeep
@@ -0,0 +1,3 @@
+# This directory contains generated performance comparison plots
+# Run examples/generate_plots.py to regenerate the plots
+
--- a/docs/algorithm_distributions.png
+++ b/docs/algorithm_distributions.png
--- a/docs/sorting_comparison.png
+++ b/docs/sorting_comparison.png
--- a/docs/sorting_comparison_bar.png
+++ b/docs/sorting_comparison_bar.png