Algorithms and OOD (CSC 207 2013F) : EBoards

CSC207.01 2013F, Class 50: Heap Sort




About the next homework

Sketch of last assignment: Turn the JSON output of an Ushahidi site (or, perhaps, any JSON output) into a useful structure. You may not use the existing JSON libraries.

A quick note about heapifying an array

In yesterday's class, one of you suggested that we could speed up the heap up process by doing both children of a node "at once". Will that work for the following heap?

{ 3, 1, 2, 7, 8 }


An opportunity to explore various aspects of heaps and heap sort.

Copyright (c) 2013 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.