c1b0fd3aaf
- 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
22 lines
618 B
Plaintext
22 lines
618 B
Plaintext
# MSCS532 Assignment 4: Heapsort and Priority Queue Implementation
|
|
# Python Dependencies
|
|
|
|
# Core functionality uses only Python standard library
|
|
# No external dependencies are required for basic usage
|
|
|
|
# Optional: For generating performance comparison plots
|
|
matplotlib>=3.5.0
|
|
numpy>=1.21.0
|
|
|
|
# Optional: For enhanced testing (if desired)
|
|
# pytest>=7.0.0
|
|
# pytest-cov>=4.0.0
|
|
|
|
# Optional: For performance profiling (if desired)
|
|
# cProfile (built-in)
|
|
# line_profiler>=4.0.0
|
|
|
|
# Note: Core functionality works with Python 3.7+ standard library only
|
|
# matplotlib and numpy are only needed for generating visualization plots
|
|
|