New edit

Author: Kushagra9399

pydatastructs/linear_data_structures/algorithms.py

@@ -1906,25 +1906,30 @@ def radix_sort(array, comp=lambda u, v: u <= v, **kwargs):
     start = kwargs.get('start', 0)
     end = kwargs.get('end', len(array) - 1)
 
-    sub_array = [array[i] for i in range(start, end + 1) if array[i] is not None]
-
-    # Remove None values from sub_array before sorting
-    sub_array = [x for x in sub_array if x is not None]
+    sub_array = []
+    max_val = 0
+    for i in range(0,len(array)):
+        sub_array.append(array[i])
+        if array[i] is not None:
+            if array[i]>max_val:
+                max_val = array[i]
 
-    # Get maximum value to determine the number of digits
-    max_val = max(sub_array) if sub_array else 0
     exp = 1
     while max_val // exp > 0:
         _count_sort_for_radix(sub_array, exp, comp)
         exp *= 10
 
     index = 0
+    none_count = 0
+    array = []
     for i in range(start, end + 1):
-        if array[i] is None:
+        if sub_array[i] is None:
+            none_count += 1
             continue
-        array[i] = sub_array[index]
+        array.append(sub_array[index])
         index += 1
 
+    array = array + [None]*none_count
     if _check_type(array, (DynamicArray, _arrays.DynamicOneDimensionalArray)):
         array._modify(True)