- 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
18 lines
402 B
Python
18 lines
402 B
Python
"""
|
|
MSCS532 Assignment 4: Heapsort and Priority Queue Implementation
|
|
|
|
This package contains implementations of:
|
|
- Heapsort algorithm
|
|
- Priority Queue data structure
|
|
- Task scheduling simulation
|
|
- Performance comparison utilities
|
|
|
|
Author: Carlos Gutierrez
|
|
Email: cgutierrez44833@ucumberlands.edu
|
|
"""
|
|
|
|
__version__ = "1.0.0"
|
|
__author__ = "Carlos Gutierrez"
|
|
__email__ = "cgutierrez44833@ucumberlands.edu"
|
|
|