Sorting:
An elaborate program to illustrate and compare a variety of sorting
algorithms.
Binary Search
(BS) Trees: Let's you insert and remove nodes in a binary search tree and
compute some tree statistics
Fast Fourier Transform (FFT): computes the Fourier series of a bit
pattern or an arbitrary function and shows how the Fourier series approximates
the sampled data.
Tower of
Hanoi: Use your own wits or double-recursion to move disks from one peg to another
peg to solve the Tower of Hanoi puzzle.
Sorting:
An elaborate program to illustrate and compare a variety of sorting
algorithms. 
Binary Search
(BS) Trees: Let's you insert and remove nodes in a binary search tree and
compute some tree statistics
Tower of
Hanoi: Use your own wits or double-recursion to move disks from one peg to another
peg to solve the Tower of Hanoi puzzle.