package Sort;
import java.util.Arrays;/**
* 希尔排序
* @author 86178
*
*/public class ShellSort{public static void main(String[] args){
int[] arr=Number.getArr(10);
System.out.println(Arrays.toString(arr));sort2(arr);
System.out.println(Arrays.toString(arr));}//交换法
public static void sort(int[] arr){
int temp=0;
for (int gap = arr.length/2; gap > 0;gap /=2){
for (int i = gap; i < arr.length;i++){
for (int j = i-gap; j >=0;j-=gap){if (arr[j]>arr[j+gap]){
temp=arr[j+gap];
arr[j+gap]=arr[j];
arr[j]=temp;}}}}}//移步法
public static void sort2(int[] arr){
for (int gap = arr.length/2; gap > 0;gap /=2){
for (int i = gap; i < arr.length;i++){
int temp=arr[i];
int index=i;if (arr[i]<arr[i-gap]){while (index - gap >=0 && temp<arr[index-gap]){
arr[index]=arr[index-gap];
index-=gap;}
arr[index]=temp;}}}}}