-
package com.imooc.repository;
-
-
import com.mysql.fabric.xmlrpc.base.Array;
-
-
import java.util.ArrayList;
-
import java.util.Arrays;
-
import java.util.List;
-
-
public
class HilSort {
-
public static void main(String[] args) {
-
-
int[] array = {
2,
3,
4,
5,
6,
7,
1};
-
-
sort(array);
-
-
List<?> list = Arrays.asList(array);
-
-
System.out.println(list);
-
}
-
-
//希尔排序i
-
public static void sort(int[] array){
-
for(
int gap = array.length/
2;gap>
0;gap = gap/
2){
-
for(
int i =
0;i<array.length;i++){
-
int j = i;
-
while (j-gap>=
0&&array[j]<array[j-gap]){
-
swap(array,i,j-gap);
-
j = j - gap;
-
}
-
-
}
-
-
}
-
-
}
-
-
public static void swap(int[] array, int i , int j){
-
array[i] = array[i]+array[j];
-
array[j]= array[i] - array[j];
-
array[i]= array[i]-array[j];
-
}
-
-
-
}