added code of radix sort

[mu593]

References to other Issues or PRs or Relevant literature

Description of the problem Radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix.

def radix_get_max_length(numbers): max_digits = 0 for num in numbers: digit_count = radix_get_length(num) if digit_count > max_digits: max_digits = digit_count return max_digits

Returns the length, in number of digits, of value

def radix_get_length(value): if value == 0: return 1

digits = 0
while value != 0:
    digits += 1
    value = value // 10 
return digits

def radix_sort(numbers): buckets = [] for i in range(10): buckets.append([])

# Find the max length, in number of digits
max_digits = radix_get_max_length(numbers)

pow_10 = 1
for digit_index in range(max_digits):
    for num in numbers:
        bucket_index = (num // pow_10) % 10
        buckets[bucket_index].append(num)

    numbers.clear()
    for bucket in buckets:
        numbers.extend(bucket)
        bucket.clear()

    pow_10 = pow_10 * 10

negatives = []
non_negatives = []
for num in numbers:
    if num < 0:
        negatives.append(num)
    else:
        non_negatives.append(num)
negatives.reverse()
numbers.clear()
numbers.extend(negatives + non_negatives)

Create a list of unsorted values

numbers = [47, 81, 13, 5, 38, 96, 51, 64]

Print unsorted list

print('UNSORTED:', numbers)

Call radix_sort to sort the list

radix_sort(numbers)

Print sorted list

print('SORTED:', numbers)

[czgdp1807]

I think you haven't added any code yet.