希尔排序(Shell's Sort),又称为“缩小增量排序(Diminishing Increment Sort)”,先将这个待排记录分割成若干子序列分别进行直接插入排序,待整个序列中的记录“基本有序”时,再对全体记录进行一次直接插入排序。
c版本
void ShellInsert(SqList &L, int dk){
for(i = dk + 1; i< L.length; ++i){
if(LT(L.r[0].key, L.r[i-dk].key)){
L.r[0]= L.r[i];
for ( j = i - dk; j>0 && LT(L.r[0].key, L.r[j].key); j-=dk)
L.r[j+dk] = L.r[j];
L.r[j+dk] = L.r[0];
}
}
}
java版本:
public class Test {
public static void ShellInsert(int SqList[], int dk) {
for (int i = dk; i < SqList.length; ++i) {
if (SqList[i] < SqList[i - dk]) {
int temp = SqList[i];
int j;
for (j = i - dk; j >= 0 && temp < SqList[j]; j -= dk)
SqList[j + dk] = SqList[j];
SqList[j + dk] = temp;
}
}
}
public static void main(String[] args) {
int arr[] = { 49, 38, 65, 97, 76, 13, 27, 49, 55, 04 };
int dlta[] = { 5, 3, 1 };
int t = dlta.length;
for (int k = 0; k < t; ++k)
ShellInsert(arr, dlta[k]);
System.out.println("\n排序之后:");
for (int element : arr) {
System.out.print(element + " ");
}
}
}
Python版本:
def ShellInsert(SqList,dk):
length = len(SqList)
for i in range(dk,length):
if SqList[i] < SqList[i - dk]:
temp = SqList[i]
j = i - dk
while j >= 0 and SqList[j] > temp:
SqList[j+dk] = SqList[j]
j = j - dk
SqList[j+dk] = temp
if __name__ == "__main__":
SqList = [49, 38, 65, 97, 76, 13, 27, 49, 55, 04]
dlta = [5,3,1]
for t in dlta:
ShellInsert(SqList,t)
for i in SqList:
print i
不稳定排序
时间复杂度 最好o(n) 最坏 o(n*n)
********************************************************************************************
Stay Hungry, Stay foolish
保持饥饿,保持愚蠢