MCPcopy Index your code
hub / github.com/python/cpython / ssort

Function ssort

Lib/turtledemo/sorting_animate.py:87–95  ·  view source on GitHub ↗
(shelf)

Source from the content-addressed store, hash-verified

85 return
86
87def 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
97def partition(shelf, left, right, pivot_index):
98 pivot = shelf[pivot_index]

Callers 1

start_ssortFunction · 0.85

Calls 2

insertMethod · 0.45
popMethod · 0.45

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…