希尔排序 

 1 package lbs;
 2 
 3 import java.util.Arrays;
 4 
 5 //希尔排序
 6 public class Num3 {
 7     public static void main(String[] args) {
 8         System.out.println("希尔排序:");
 9         int arr[] = {2,4,1,3,5,7,9,8,6};
10         System.out.println(Arrays.toString(arr));
11         
12         for (int gap = arr.length/2; gap > 0; gap/=2) {
13             for (int i = gap; i < arr.length; i++) {
14                 int j = i;
15                 int temp = arr[j];
16                 while (j-gap >= 0 && arr[j] < arr[j-gap]) {
17                     arr[j]=arr[j-gap];
18                     arr[j-gap]=temp;
19                     j-=gap;
20                 }
21             }
22         }
23         
24         System.out.println(Arrays.toString(arr));
25     }
26 }

 

posted @ 2022-03-20 17:45  tobeachallenger  阅读(16)  评论(0)    收藏  举报