Sorting algorithms/Radix sort: Difference between revisions
Content added Content deleted
m (→{{header|Tailspin}}: use new integer division operator) |
|||
| Line 1,970: | Line 1,970: | ||
result = [] |
result = [] |
||
for b in bins: |
for b in bins: |
||
#If the bin is empty it skips the recursive call |
|||
if b == []: |
|||
continue |
|||
# Make the recursive call |
# Make the recursive call |
||
# Sort each of the sub-lists in our bins |
# Sort each of the sub-lists in our bins |
||