(arr []T)
| 33 | } |
| 34 | |
| 35 | func unsignedRadixSort[T constraints.Integer](arr []T) []T { |
| 36 | if len(arr) == 0 { |
| 37 | return arr |
| 38 | } |
| 39 | maxElement := max.Int(arr...) |
| 40 | for exp := T(1); maxElement/exp > 0; exp *= 10 { |
| 41 | arr = countSort(arr, exp) |
| 42 | } |
| 43 | return arr |
| 44 | } |
| 45 | |
| 46 | func RadixSort[T constraints.Integer](arr []T) []T { |
| 47 | if len(arr) < 1 { |