mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
47 lines
1.2 KiB
Python
47 lines
1.2 KiB
Python
"""
|
|
This is a pure Python implementation of the radix sort algorithm
|
|
|
|
Source: https://en.wikipedia.org/wiki/Radix_sort
|
|
"""
|
|
from __future__ import annotations
|
|
|
|
|
|
def radix_sort(list_of_ints: list[int]) -> list[int]:
|
|
"""
|
|
Examples:
|
|
>>> radix_sort([0, 5, 3, 2, 2])
|
|
[0, 2, 2, 3, 5]
|
|
|
|
>>> radix_sort(list(range(15))) == sorted(range(15))
|
|
True
|
|
>>> radix_sort(list(range(14,-1,-1))) == sorted(range(15))
|
|
True
|
|
>>> radix_sort([1,100,10,1000]) == sorted([1,100,10,1000])
|
|
True
|
|
"""
|
|
RADIX = 10 # noqa: N806
|
|
placement = 1
|
|
max_digit = max(list_of_ints)
|
|
while placement <= max_digit:
|
|
# declare and initialize empty buckets
|
|
buckets: list[list] = [list() for _ in range(RADIX)]
|
|
# split list_of_ints between the buckets
|
|
for i in list_of_ints:
|
|
tmp = int((i / placement) % RADIX)
|
|
buckets[tmp].append(i)
|
|
# put each buckets' contents into list_of_ints
|
|
a = 0
|
|
for b in range(RADIX):
|
|
for i in buckets[b]:
|
|
list_of_ints[a] = i
|
|
a += 1
|
|
# move to next
|
|
placement *= RADIX
|
|
return list_of_ints
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|