Archive for October, 2005
Heap
Tuesday, October 18th, 2005
A Heap is a really interesting data structure. It uses an array to hold it's elements, but the elements are ordered in such a way to form a binary tree. A heap can be used to sort an array efficiently, but other algorithms such as QuickSort are usually faster. A
Game Design: Magnet
Monday, October 17th, 2005
This is another idea we came up with for something that would be quick to produce. We originally planned to make it a downloadable game in Python, because we wanted to do a lot of things that wouldn't be feasible in Flash, but now with Flash 8 they are possible!
![[FSF Associate Member]](img/fsf_member.png){kind=small}