August Meeting 2007
From DojoWiki
August 28th Meeting
Heaps and Priority Queues
As with last months LinkedList lesson, we'll be working together to choose some implementations of a Heap.
I've gotten started with some trivial inserts, written in Java, but haven't done any work on a recursive Swap algorithm (which will be needed).
During the meeting, I continued working on a Balanced Binary MinHeap. Bruce completed a Skewed heap in Python. Not sure how everyone else faired; but we had a couple people working on Array based heaps, rather than using trees.
The links below provide some great information to get started.
This is a more complicated topic than LinkedLists, so hopefully we'll get some good coverage during hour two our meeting.
http://en.wikipedia.org/wiki/Heap_(data_structure)
Some more information, including an animation
http://www.cs.auckland.ac.nz/software/AlgAnim/heaps.html
An article by Dan Sleator about self-adjust heaps:
