(shelf)
| 85 | return |
| 86 | |
| 87 | def ssort(shelf): |
| 88 | length = len(shelf) |
| 89 | for j in range(0, length - 1): |
| 90 | imin = j |
| 91 | for i in range(j + 1, length): |
| 92 | if shelf[i].size < shelf[imin].size: |
| 93 | imin = i |
| 94 | if imin != j: |
| 95 | shelf.insert(j, shelf.pop(imin)) |
| 96 | |
| 97 | def partition(shelf, left, right, pivot_index): |
| 98 | pivot = shelf[pivot_index] |
no test coverage detected
searching dependent graphs…