[数据结构][Sort]Shell Sort

public class Solution 
{
    public void shellSort(int[] data)
    {
        for(int i = data.length / 2; i > 0; i = i / 2)
        {
            for(int j = 0; j < i; j ++)
            {
                insertSort(data, j, i);
            }
        }
    }
    
    public void insertSort(int[] data, int begin, int distance)
    {
        for(int i = begin + distance; i < data.length; i = i + distance)
        {
            int key = data[i];
            
            int pointer = i - distance;
            
            while((pointer >= 0) && (data[pointer] > key))
            {
                data[pointer + distance] = data[pointer];
                
                pointer = pointer - distance;
            }
            
            data[pointer + distance] = key;
        }
    }

}