---

shell（希尔排序）

---

---

原理:参考趣学数据结构

---

---

代码：

---

#include<stdio.h>
#include<stdlib.h>
void shellInsert(int b[],int dk,int length) {//希尔排序以dk的增量插入int j;for (int i = 1 + dk; i <= length-1; i++) {b[0] = b[i];//哨兵监听可能需要排序的数for (j = i - dk; j > 0 && b[j] > b[0]; j -= dk) {b[j + dk] = b[j];//把比需要排序的数与前面相隔dk个排好序的数比较，如果有更大的数则继续往前比较，直到插入}b[j + dk] = b[0];}
}
void shellSort(int b[], int dk[],int length,int length1) {//以每个dk1增量进行排序for (int i = 0; i < length1; i++) {shellInsert(b, dk[i], length);}
}
void print(int a[],int length) {//遍历for (int i = 1; i < length; i++) {printf("%d ", a[i]);}printf("\n");
}
int main() {int a[] = { -1,3,4,2,5,2,6,86,54,32 };int dk[] = { 1,3,5 };int length = sizeof(a) / sizeof(a[0]);int length1 = sizeof(dk) / sizeof(dk[0]);printf("排序之前\n");print(a,length);printf("排序之后\n");shellSort(a, dk, length,length1);print(a,length);system("pause");return 0;
}

---

测试

---

---

特点：

---

---

时间复杂度为O(nlogn)，不稳定

---

---

如果存在什么问题，欢迎批评指正！谢谢！

---