Skip to content

Update algorithms.py for Radix sort #621

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
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
65 changes: 64 additions & 1 deletion pydatastructs/linear_data_structures/algorithms.py
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,8 @@
'jump_search',
'selection_sort',
'insertion_sort',
'intro_sort'
'intro_sort',
'radix_sort'
]

def _merge(array, sl, el, sr, er, end, comp):
Expand Down Expand Up @@ -1850,3 +1851,65 @@ def partition(array, lower, upper):
intro_sort(array, start=p+1, end=upper, maxdepth=maxdepth-1, ins_threshold=ins_threshold)

return array

def _count_sort_for_radix(array, exp, comp):
n = len(array)
output = [None] * n
count = [0] * 10

for i in range(n):
index = (array[i] // exp) % 10
count[index] += 1

for i in range(1, 10):
count[i] += count[i - 1]

i = n - 1
while i >= 0:
index = (array[i] // exp) % 10
output[count[index] - 1] = array[i]
count[index] -= 1
i -= 1

for i in range(n):
array[i] = output[i]

def radix_sort(array, comp=lambda u, v: u <= v, **kwargs):
"""
Implements Radix Sort.

Parameters
==========
array: Array
The array which is to be sorted.
comp: lambda/function
The comparator which is to be used
for sorting. Optional, by default, less than or
equal to is used for comparing two
values.

Examples
========
>>> from pydatastructs import OneDimensionalArray, radix_sort
>>> arr = OneDimensionalArray(int,[170, 45, 75, 90, 802, 24, 2, 66])
>>> radix_sort(arr)
>>> [arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7]]
[2, 24, 45, 66, 75, 90, 170, 802]

References
==========
.. [1] https://en.wikipedia.org/wiki/Radix_sort
"""
# Raise error if not Python backend
raise_if_backend_is_not_python(radix_sort, kwargs.get('backend', Backend.PYTHON))

# Get maximum number to determine number of digits
max_val = max(array)

exp = 1
while max_val // exp > 0:
_count_sort_for_radix(array, exp, comp)
exp *= 10

if _check_type(array, (DynamicArray, _arrays.DynamicOneDimensionalArray)):
array._modify(True)
Loading