package 希尔排序;
public class 希尔排序排序 {
public static void a1(int[] arr)
{
for(int j = arr.length/2;j > 0;j = j / 2)
{
for(int i = j;i < arr.length;i ++)
{
int index = arr[i];
int all = i - j;
while(all >= 0 && index < arr[all])
{
arr[all + j] = arr[all];
all -= j;
}
arr[all + j] = index;
}
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {-2,1,3,12,10000,123,456794,6,8,-56,56,1};
a2(arr);
for(int i = 0; i < arr.length;i ++)
{
System.out.println(arr[i]);
}
}
}
算法很美--查找排序(上)--2.8思维更重要希尔排序
猜你喜欢
转载自blog.csdn.net/qq_40839934/article/details/86517242
今日推荐
周排行