File intro_sort.py

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

Source from the content-addressed store, hash-verified

1	"""
2	Introspective Sort is a hybrid sort (Quick Sort + Heap Sort + Insertion Sort)
3	if the size of the list is under 16, use insertion sort
4	https://en.wikipedia.org/wiki/Introsort

nothing calls this directly

sortFunction · 0.85

splitMethod · 0.80

no test coverage detected