希尔排序

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class XierSort {
public static void main(String[] args) throws IOException {
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
String []s=in.readLine().trim().split(" ");
int a[]=new int[s.length];
for (int i = 0; i < s.length; i++) {
a[i]=Integer.parseInt(s[i]);
}
a=sortPrint(a);
for (int i :a) {
System.out.print(i+" ");
}
System.out.println();
}






private static int[] sortPrint(int[] a) {
// TODO Auto-generated method stub
int sum=a.length/2;
while (sum>=1) {
for (int j = 0; j < a.length; j++) {
for (int i = 0; i < a.length-sum; i=i+sum) {
if (a[i]>a[i+sum]) {
a[i]=a[i]+a[i+sum];
a[i+sum]=a[i]-a[i+sum];
a[i]=a[i]-a[i+sum];
    }

    }
   }
sum=sum/2;
}
return a;
}

}

输入：

3 1 5 7 2 4 9 6 

输出：
1 2 3 4 5 6 7 9 

时间复杂度：你（nlog2n）

空间复杂度O(1)