Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions sorts/tim_sort.py
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@


def binary_search(lst: list[Any], item: Any, start: int, end: int) -> int:
"""
Find the index where an item should be inserted in a sorted list
"""

if start == end:
return start if lst[start] > item else start + 1
if start > end:
Expand All @@ -17,6 +21,9 @@ def binary_search(lst: list[Any], item: Any, start: int, end: int) -> int:


def insertion_sort(lst: list[Any]) -> list[Any]:
"""
Sort a list using insertion sort and binary search
"""
length = len(lst)

for index in range(1, length):
Expand All @@ -28,6 +35,9 @@ def insertion_sort(lst: list[Any]) -> list[Any]:


def merge(left: list[Any], right: list[Any]) -> list[Any]:
"""
Merge two sorted lists into one sorted list
"""
if not left:
return right

Expand Down