algorithms/algorithms/sorting/insertion_sort.py at main · keon/algorithms

39 lines (28 loc) · 858 Bytes

"""

Insertion Sort

Insertion sort builds the sorted list one element at a time by repeatedly

picking the next element and inserting it into its correct position.

Reference: https://en.wikipedia.org/wiki/Insertion_sort

Complexity:

Time: O(n) best / O(n^2) average / O(n^2) worst

Space: O(1)

"""

from __future__ import annotations

def insertion_sort(array: list[int]) -> list[int]:

"""Sort an array in ascending order using insertion sort.

Args:

array: List of integers to sort.

Returns:

A sorted list.

Examples:

>>> insertion_sort([3, 1, 2])

[1, 2, 3]

"""

for i in range(len(array)):

cursor = array[i]

pos = i

while pos > 0 and array[pos - 1] > cursor:

array[pos] = array[pos - 1]

pos -= 1

array[pos] = cursor

return array

Provide feedback