> > AVL-tree sort
> > Binary tree sort
> > exchange sort(array)
> > general tree sort
> > hash table sort
> > heap sort (array)
> > insertion sort (linear linked list)
> > merge_sort (array and linear linked list)
> > quadratic selection sort(have no idea about this one)
> > radix sort
> > shell sort
> Try http://www.adapower.com . The Booch Components is a good start
> for this kind of thing.
The 95 BCs use only AVL, binary, & insertion sorts. The C++ components
on which they are based have more in the way of algorithms, but I
don't quite see how to implement them (haven't thought very hard, I
must say).
Perhaps the 83 BCs (are they at Adapower yet?) have more.