///////
//
// Student: Russell Lowke
//     T.F: Francis Crick
// Unit Eight, pencil-and-paper - question 5 [worth 2pts],  8/2/2002
//
//  Radix-sort algorithm described at the end of Unit 7 lends itself to
//  a linked-list implementation. 
//  describe an algorithim for sorting a large linked list comprised of six digit numbers
//

1) An array of 10 linked list bins is initialized, one for each digit 0-9.
2) The list of numbers is then parsed into the bin lists by looking only at the units digit,
   a number ending in 1 would be passed to the [1] bin, a number ending in 9 to the [9] bin,
   so on and so forth until the list is exhausted.
3) the bin lists are then linked back into the original linked list with the [0] bin first,
   through to the [9] bin.
4) the process from 2) & 3) is repeated, only instead of looking at units, the search is for tens,
   then hundreds, then thousands, then tens of thousands, then hundreds of thousands.  A number
   that has no value for the pass, i.e. a 7 in the thousands pass, is sorted into the [0] bin.
5) after the hundreds of thousands pass, all the numbers should be correctly sorted into the
   linked list.