A QUOI RESSEMBLE UN TRI ENCORE?

package ShellSort;

import java.util.Arrays;

public class deSanyFromBelgiumSort 
{
  private int[] local;            //copy of the array.
  private int increment = 1;      //jump in the array.
  private int size;               //size of the array.
  private int c,j;                //useful for the trt
  private int cpt,cpt2;           //the counters.

  public deSanyFromBelgiumSort(){}
  
  //JAVA SORT
  public int[] javaSort(int[] tmp){    
    local = tmp;
    Arrays.sort(local);
    return local;
  }
  
  //MY SORT
  // => MYSORT    IS FASTER WITH SMALL ARRAYS.
  // => JAVASORT  IS BETTER WITH MEDIUM ARRAYS.
  // => EQUIVALENT          WITH HUGE ARRAYS.
  public int[] mySort(int[] tmp){            
    local = tmp;
    size = tmp.length;
    
    while(increment < (size/9)) increment = (increment * 3) + 1;  //FIRST LOOP TO DETERMINE THE JUMP SIZE
    
    
    do{
      for (cpt = 1; cpt <= increment; cpt ++){          
        for (cpt2 = increment+cpt; cpt2 < size; cpt2+=increment){                    
          c = local[cpt2];
          j = cpt2 - increment;
          while ((j >= 0) && (local[j] > c)){
            local[j+increment] = local[j];
            j -= increment;
          }
          local[j+increment] = c;
        }//FOR 2        
      }//FOR 1
      increment /= 3; 
    }while(increment != 0);        
    return local;
  }
}

Télécharger le zip