CScD 327:  Drill Programs (Spring 2002)

Sorting Animation     Includes comparison counts and data movement counts for various sorting algorithms.

Random sequence generator (for in-class drills).    Source code (requires Borland C).

Binary Search Tree Insertion Drill   Incremental drill on building a binary search tree

Binary Search Tree:   generation of 26-node trees, followed by character-graphics display

Binary Search Tree Deletion Drill    Incremental drill on deleting nodes in a binary search tree

AVL Trees:   Link to 3 May 2002 for the AVLdemo program.

B Trees:  Link to 7 May 2002 for ProbGen.exe — random inserts followed by random deletes for a B-tree

Heap1:   root at [1]:  Heap generation by enqueue, by Enter/FixHeap; Heap dequeues.

Heap0:   root at [0]:  Heap generation by enqueue, by Enter/FixHeap; Heap dequeues.

Page updated on 2002/05/28 at 11:53