File timsort.py

sorts/timsort.py:None–None · view source on GitHub ↗

Source from the content-addressed store, hash-verified

1	from __future__ import print_function
2	def binary_search(lst, item, start, end):
3	if start == end:
4	if lst[start] > item:

nothing calls this directly

mainFunction · 0.70

no test coverage detected