heap-heap-hoorah

#Heap Heap Hoorah!

####Assignment 8

Build a heap stored in an array. Let user add and remove elements. Show in GUI what the original heap array looked like and which elements had to swap to respect the rule that every root of each subtree contains the respective minimum (of that subtree.)

Source: http://knight.temple.edu/~lakamper/courses/cis2168_2013FALL/assignments/Assignment8.pdf

Project realized in Java using NetBeans.