MR> this is the confusing part :-
MR>         while(test == 0)
MR>         {
MR>                 test = 1;
MR>                 for (i = 0; i < (MAX - 1); i++)
MR>                 {
MR>                         if (table[i] < table[i + 1])
MR>                         {
MR>                                 temp = table[i];
MR>                                 table[i] = table[ i + 1];
MR>                                 table[i + 1] = temp;
MR>                                 test = 0;
MR>                         }
MR>                 }
MR>         }
This is bubble sort. You can look it up in every algorithms textbook.
Thomas
---
 þ MM 1.0 #0113 þ RAM DISK is NOT an installation procedure!
---------------