各类排序算法java的实现

shell排序:
package org.rut.util.algorithm.support;

import org.rut.util.algorithm.SortUtil;

/**
* @author treeroot
* @since 2006-2-2
* @version 1.0
*/
public class ShellSort implements SortUtil.Sort{

  /* (non-Javadoc)
  * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
  */
  public void sort(int[] data) {
    for(int i=data.length/2;i>2;i/=2){
        for(int j=0;j<i;j++){
          insertSort(data,j,i);
        }
    }
    insertSort(data,0,1);
  }

  /**
  * @param data
  * @param j
  * @param i
  */
  private void insertSort(int[] data, int start, int inc) {
    int temp;
    for(int i=start+inc;i<data.length;i+=inc){
        for(int j=i;(j>=inc)&&(data[j]<data[j-inc]);j-=inc){
          SortUtil.swap(data,j,j-inc);
        }
    }
  }

}
SortUtil:

package org.rut.util.algorithm;

import org.rut.util.algorithm.support.BubbleSort;
import org.rut.util.algorithm.support.HeapSort;
import org.rut.util.algorithm.support.ImprovedMergeSort;
import org.rut.util.algorithm.support.ImprovedQuickSort;
import org.rut.util.algorithm.support.InsertSort;
import org.rut.util.algorithm.support.MergeSort;
import org.rut.util.algorithm.support.QuickSort;
import org.rut.util.algorithm.support.SelectionSort;
import org.rut.util.algorithm.support.ShellSort;

/**
* @author treeroot
* @since 2006-2-2
* @version 1.0
*/
public class SortUtil {
  public final static int INSERT = 1;

  public final static int BUBBLE = 2;

  public final static int SELECTION = 3;

  public final static int SHELL = 4;

  public final static int QUICK = 5;

  public final static int IMPROVED_QUICK = 6;

  public final static int MERGE = 7;

  public final static int IMPROVED_MERGE = 8;

  public final static int HEAP = 9;

  public static void sort(int[] data) {
    sort(data, IMPROVED_QUICK);
  }
  private static String[] name={
        "insert","bubble","selection","shell","quick","improved_quick","merge","improved_merge","heap"
  };
  
  private static Sort[] impl=new Sort[]{
        new InsertSort(),
        new BubbleSort(),
        new SelectionSort(),
        new ShellSort(),
        new QuickSort(),
        new ImprovedQuickSort(),
        new MergeSort(),
        new ImprovedMergeSort(),
        new HeapSort()
  };

  public static String toString(int algorithm){
    return name[algorithm-1];
  }
  
  public static void sort(int[] data, int algorithm) {
    impl[algorithm-1].sort(data);
  }

  public static interface Sort {
    public void sort(int[] data);
  }

  public static void swap(int[] data, int i, int j) {
    int temp = data;
    data = data[j];
    data[j] = temp;
  }
}