FilesExpand file tree

 Write-for-current-Python

/

radix_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (45 loc) · 1.32 KB

 Write-for-current-Python

/

radix_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (45 loc) · 1.32 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

"""

This is a pure Python implementation of the quick sort algorithm

For doctests run following command:

python -m doctest -v radix_sort.py

or

python3 -m doctest -v radix_sort.py

For manual testing run:

python radix_sort.py

"""

from __future__ import annotations

from typing import List

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

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()