import java.util.Arrays;
public class xier_jiaohuan {
public static void main(String[] args) {
int[] arr = new int[]{2,9,1,6,4,8};
System.out.println(Arrays.toString(sort(arr)));
}
public static int[] 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];
arr[j] = arr[j+gap];
arr[j+gap] = temp;
}
}
}
}
return arr;
}
}
交换法!!!!
import java.util.Arrays;
public class xier_yiwei {
public static void main(String[] args) {
int[] arr = new int[]{2,9,1,6,4,8};
System.out.println(Arrays.toString(sort(arr)));
}
public static int[] sort(int[] arr){
for(int gap = arr.length/2;gap>0;gap/=2){
for(int i = gap;i<arr.length;i++){
int j = i;
int temp = arr[j];
if(arr[j]<arr[j-gap]){
while(j-gap>=0 && temp<arr[j-gap]){
arr[j] = arr[j-gap];
j -= gap;
}
arr[j] = temp;
}
}
}
return arr;
}
}
移位法