Another update from ingydotnet^djgoku

Task/Sorting-algorithms-Radix-sort/Ruby/sorting-algorithms-radix-sort-1.rb

@@ -1,7 +1,7 @@
 class Array
   def radix_sort(base=10)
     ary = dup
-    rounds = (Math.log(ary.minmax.map(&:abs).max)/Math.log(base)).ceil
+    rounds = (Math.log(ary.minmax.map(&:abs).max)/Math.log(base)).floor + 1
     rounds.times do |i|
       buckets = Array.new(2*base){[]}
       base_i = base**i
@@ -23,3 +23,4 @@ end
 p [1, 3, 8, 9, 0, 0, 8, 7, 1, 6].radix_sort
 p [170, 45, 75, 90, 2, 24, 802, 66].radix_sort
 p [170, 45, 75, 90, 2, 24, -802, -66].radix_sort
+p [100000, -10000, 400, 23, 10000].radix_sort

Task/Sorting-algorithms-Radix-sort/Ruby/sorting-algorithms-radix-sort-2.rb

@@ -0,0 +1,13 @@
+class Array
+  def radix_sort(base=10)
+    ary = dup
+    m, max = 1, ary.minmax.map(&:abs).max
+    while m <= max
+      buckets = Array.new(base){[]}
+      ary.each {|n| buckets[(n.abs / m) % base] << n}
+      ary = buckets.flatten
+      m *= base
+    end
+    ary.partition{|n| n<0}.inject{|minus,plus| minus.reverse + plus}
+  end
+end