Commit 4515451

@@ -0,0 +1,31 @@
+require "spec_helper"
+
+describe "Algorithm efficiency" do
+
+  it "should sort an array of 100 numbers" do
+    run(100)
+  end
+
+  it "should sort an array of 500 numbers" do
+    run(500)
+  end
+
+  it "should sort an array of 1000 numbers" do
+    run(1000)
+  end
+
+  it "should sort an array of 5000 numbers" do
+    run(5000)
+  end
+
+  def run(n)
+    numbers = Array.new(n) { rand(n) }
+    Benchmark.bmbm do |x|
+      x.report("#{n}-bubble") { BubbleSort.new.sort(numbers) }
+      x.report("#{n}-insertion") { InsertionSort.new.sort(numbers) }
+      x.report("#{n}-merge") { MergeSort.new.sort(numbers) }
+      x.report("#{n}-quick") { QuickSort.new.sort(numbers) }
+      x.report("#{n}-ruby") { numbers.sort }
+    end
+  end
+end