(alist, start, gap)
| 8 | return alist |
| 9 | |
| 10 | def gapInsertionSort(alist, start, gap): |
| 11 | for i in range(start+gap, len(alist), gap): |
| 12 | currentValue = alist[i] |
| 13 | position = i |
| 14 | |
| 15 | while position >= gap and alist[position-gap] > currentValue: |
| 16 | alist[position] = alist[position-gap] |
| 17 | position = position-gap |
| 18 | alist[position] = currentValue |
| 19 | |
| 20 | alist = [54,26,93,17,77,31,44,55,20] |
| 21 | print(shellSort(alist)) |