sort_reverse_benchmarking.rb

#!/usr/bin/ruby

require 'benchmark'

puts "Running Ruby #{RUBY_VERSION}"


ary = []
1000.times {
  ary << {
    char: (65 + rand(26)).chr,
    percent: rand(100)
  }
}

n = 500

puts "n=#{n}"
Benchmark.bm(20) do |x|
  x.report("sort")           {n.times {ary.dup.sort{|a,b| [a[:percent], b[:char]] <=> [b[:percent], a[:char]]}}}
  x.report("sort reverse")   {n.times {ary.dup.sort{|a,b| [a[:percent], b[:char]] <=> [b[:percent], a[:char]]}.reverse}}
  x.report("sort -1")        {n.times {ary.dup.sort{|a,b| ([a[:percent], b[:char]] <=> [b[:percent], a[:char]]) * -1}}}
  x.report("sort! -1")       {n.times {ary.dup.sort!{|a,b| ([a[:percent], b[:char]] <=> [b[:percent], a[:char]]) * -1}}}
  x.report("sort! reverse!") {n.times {ary.dup.sort!{|a,b| [a[:percent], b[:char]] <=> [b[:percent], a[:char]]}.reverse!}}
end

If anything my way is coming out worse when I run it, haha...