From: rigelau@yahoo.com.au   
      
   legiamo_6660@yahoo-dot-com.no-spam.invalid (xantarc) wrote in   
   news:42464aa6_3@127.0.0.1:   
      
   >   
   > Alan is right.   
   > Hmm...   
   >   
   > And one more questions, does anyone knows which sorting method is most   
   > efficient in Pascal? Is QuickSort the most efficient?   
   > Posted at: http://www.groupsrv.com   
      
   This is a difficult question to answer.  One text book I have describes the   
   QuickSort as having "a very good average behaviour".   
      
   One has to take into account the total number of items to be sorted.   Can   
   they all fit into memory at the same time?  Is it best to create a binary   
   tree when inputting the data and then traverse the tree to unload the data   
   in order?   
      
   Do you have to create intermediate external files and then merge them?   
   Will the data items be in total random order, or partially ordered?   
      
   If there is only a small number of records, and the record size is small,   
   it is likely that an Insertion sort is the most efficient.   
      
   Most computing textbooks will have a chapter on sorting techniques and   
   usually have comparisons of the different methods of sorting.   
      
   Also have a look at the FAQ and Google "sort methods comparison" or   
   something like that.   
      
   Alan   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)