最近几天一直在复习数据结构。正好今天想做点笔记,第一次写文章,就从希尔排序开始写吧。
package pers.yzb.code;public class Code8_329 {
/**
* @param args
*/
public static void main(String[] args) {
int[] array = {44,6,7,90,30,69};
shellSort(array);
for(int i = 0; i < array.length; i++){
System.out.print(array[i] + " ");
}
}
public static void shellSort(int[] array){
int i,j;
int temp;
int length = array.length;
for(int h = length/2; h > 0; h = h/2){
for(i = h; i < length; i++){
temp = array[i];
for(j = i - h; j >= 0; j = j-h){
if(temp < array[j]){
array[j+h] = array[j];
}
else{
break;
}
}
array[j+h] = temp;
}
}
}
}