(alist)
| 1 | # python实现希尔排序 |
| 2 | def shellSort(alist): |
| 3 | sublistcount= len(alist)//2 |
| 4 | while sublistcount > 0: |
| 5 | for startposition in range(sublistcount): |
| 6 | gapInsertionSort(alist, startposition, sublistcount) |
| 7 | sublistcount = sublistcount//2 |
| 8 | return alist |
| 9 | |
| 10 | def gapInsertionSort(alist, start, gap): |
| 11 | for i in range(start+gap, len(alist), gap): |
no test coverage detected