多种排序法，如插入，快速等

package   com.cucu.test;     
    
  /**     
    *   @author   http://www.hyxp.net   <a   href=mailto:cg@linewell.com>cg@linewell.com</a>     
    *   @version   1.0     
    */     
  public   class   Sort   {     
    
      public   void   swap(int   a[],   int   i,   int   j)   {     
          int   tmp   =   a[i];     
          a[i]   =   a[j];     
          a[j]   =   tmp;     
      }     
    
      public   int   partition(int   a[],   int   low,   int   high)   {     
          int   pivot,   p_pos,   i;     
          p_pos   =   low;     
          pivot   =   a[p_pos];     
          for   (i   =   low   +   1;   i   <=   high;   i++)   {     
              if   (a[i]   >   pivot)   {     
                  p_pos++;     
                  swap(a,   p_pos,   i);     
              }     
          }     
          swap(a,   low,   p_pos);     
          return   p_pos;     
      }     
    
      public   void   quicksort(int   a[],   int   low,   int   high)   {     
          int   pivot;