package Sort;
import java.util.Arrays;
// 与直接插入排序的区别和联系:按步长分组,同一组内进行直接插入排序(直接插入步长为1,希尔排序一般选n/2为步长,依次除以2)
// 时间复杂度 nlogn
public class ShellSort
{
public static void main(String[] args)
{
int[] arr = {5, 4, 3, 2, 1};
ShellSort(arr,arr.length);
}
static void ShellSort(int[] arr, int len)
{
for (int gap = len/2;gap > 0;gap = gap/2)
{
for (int i = gap;i < len;i++)
{
int j = i;
while (j - gap >= 0 && arr[j] < arr[j - gap])
{
// Swap(arr,j,j - gap);
int t = arr[j];
arr[j] = arr[j-gap];
arr[j-gap] = t;
j = j - gap;
System.out.println(Arrays.toString(arr));
}
// System.out.println(Arrays.toString(arr));
}
}
}
}