MCPcopy Create free account
hub / github.com/Jack-Lee-Hiter/AlgorithmsByPython / MergeSort.py

File MergeSort.py

MergeSort.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1def mergeSort(alist):
2 if len(alist) > 1:
3 mid = len(alist)//2
4 lefthalf = alist[:mid]

Callers

nothing calls this directly

Calls 1

mergeSortFunction · 0.85

Tested by

no test coverage detected