(shelf)
| 76 | b.unglow() |
| 77 | |
| 78 | def isort(shelf): |
| 79 | length = len(shelf) |
| 80 | for i in range(1, length): |
| 81 | hole = i |
| 82 | while hole > 0 and shelf[i].size < shelf[hole - 1].size: |
| 83 | hole = hole - 1 |
| 84 | shelf.insert(hole, shelf.pop(i)) |
| 85 | return |
| 86 | |
| 87 | def ssort(shelf): |
| 88 | length = len(shelf) |
no test coverage detected
searching dependent graphs…