From: w.clodius@icloud.com   
      
   Martin Ward  wrote:   
      
   > > [Give or take the detail that bubble sort is never the right   
   algorithm   
   > since insertion sort is shorter and faster, I agree. -John]   
      
   I believe that bubble sort is faster if the data is usually presorted.   
   The Unicode consortium describes the sorting of codepoints to forn the   
   normalization forms, because the initial decomposition process usually   
   results in an ordering that is usually in or close to the desired order.   
      
   [It's the reverse.  Insertion sort is O(N) if the list is already sorted.   
   See http://www.differencebetween.com/difference-between-bubble-s   
   rt-and-vs-insertion-sort/   
   -John]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)