Held: Tuesday, 3 December 2013

Back to Outline 49 - Heaps. On to Outline 51 - Dynamic Programming.

Summary

We ground our understanding of heaps and heap sort by developing a heap sort algorithm and modifying our heap implementation.

Related Pages

• Lab: Heaps and Heap Sort
• Code: https://github.com/Grinnell-CSC207/heaps
• EBoard (Source) (HTML) (PDF)

Overview

• Lab.

Administrivia

• 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.
  • Sample API call: http://sidewalks.latimes.com/api?task=incidents
  • JSON Format http://www.json.org/
• Upcoming extra credit opportunities:
  • Learning from Alumni Thursday: Erik Hanson (in person)
  • CS Extras Thursday: Summer opportunities in CS.
  • CS Table Friday: TBD.
  • Swim meet Friday and Saturday.
  • Any self-care week activity.
  • One Grinnell rally on December 4 at 4pm (unless you are taking photos).
    • I've heard that students chose the time, and that no time was without conflicts. Sorry that I can't give you a better answer.

Lab

• Do the lab.