[算法] shell sort

public void sort(int[] list) {
    int gap = list.length / 2;
    while (1 <= gap) {
        for (int i = gap; i < list.length; i++) {
            int j = 0;
            int temp = list[i];
            for (j = i - gap; j >= 0 && temp < list[j]; j = j - gap) {
                list[j + gap] = list[j];
            }
            list[j + gap] = temp;
        }

        gap = gap / 2;    
    }
}