From: charlesappel@mindspring.com   
      
   "xantarc"  wrote in message   
   news:42464aa6_3@127.0.0.1...   
   > And one more questions, does anyone knows which sorting method is most   
   > efficient in Pascal? Is QuickSort the most efficient?   
      
   It depends on what you are sorting. QuickSort is   
   very efficient when dealing with large arrays of   
   generally random data. It is less efficient with data   
   that is more or less already in order. The only way   
   to be sure, is to test.   
      
   I'm currently finishing up a project that must sort very   
   small arrays. After testing nine different sort routines, I   
   implemented a bubble sort variant because it proved   
   to be the fastest (for what I'm doing).   
      
   --   
   Charles Appel   
   "A generation which ignores history has no past - and no future."   
         Robert Anson Heinlein   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)