ICS 211 Spring 2021
Modules
Outcomes
Readings
Experiences
Assessments
Schedule
Home
Modules
Complex Sorting Algorithms
Practice: Heap Sort
Practice: Heap Sort
Take out a piece of paper.
1 Write the pseudo code for the Heap Sort algorithm of an array of ints.
Describe the steps in some detail.
2 Write up an analysis of the Big O performance for this sort.
3 Show me your code and analysis.