(alist)
| 1 | def insertionSort(alist): |
| 2 | for key, item in enumerate(alist): |
| 3 | index = key |
| 4 | while index > 0 and alist[index-1] > item: |
| 5 | alist[index] = alist[index-1] |
| 6 | index -= 1 |
| 7 | alist[index] = item |
| 8 | return alist |
| 9 | |
| 10 | alist = [54,26,93,17,77,31,44,55,20] |
| 11 | print(insertionSort(alist)) |