sorts.tim_sort

Functions

binary_search(→ int)
insertion_sort(→ list[Any])
main()
merge(→ list[Any])
tim_sort(→ list[Any])

Module Contents

sorts.tim_sort.binary_search(lst: list[Any], item: Any, start: int, end: int) → int

sorts.tim_sort.insertion_sort(lst: list[Any]) → list[Any]

sorts.tim_sort.main()

sorts.tim_sort.merge(left: list[Any], right: list[Any]) → list[Any]

sorts.tim_sort.tim_sort(lst: list[Any] | tuple[Any, Ellipsis] | str) → list[Any]

>>> tim_sort("Python")
['P', 'h', 'n', 'o', 't', 'y']
>>> tim_sort((1.1, 1, 0, -1, -1.1))
[-1.1, -1, 0, 1, 1.1]
>>> tim_sort(list(reversed(list(range(7)))))
[0, 1, 2, 3, 4, 5, 6]
>>> tim_sort([3, 2, 1]) == insertion_sort([3, 2, 1])
True
>>> tim_sort([3, 2, 1]) == sorted([3, 2, 1])
True