Quick sort

CONTRIBUTING.md

@@ -0,0 +1 @@
+teste

lib/sorting_algorithms.rb

@@ -4,6 +4,7 @@
 require_relative "sorting_algorithms/insertion_sort"
 require_relative "sorting_algorithms/selection_sort"
 require_relative "sorting_algorithms/merge_sort"
+require_relative "sorting_algorithms/quick_sort"
 
 module SortingAlgorithms
 end

lib/sorting_algorithms/quick_sort.rb

@@ -0,0 +1,26 @@
+# frozen_string_literal: true
+
+module SortingAlgorithms
+  module QuickSort
+    class << self
+      def call(array)
+        return array if array.length <= 1
+
+        pivot = array.last
+        left = []
+        right = []
+
+        array[0...-1].each do |element|
+          if element <= pivot
+            left << element
+
+          else
+            right << element
+          end
+        end
+
+        call(left) + [pivot] + call(right)
+      end
+    end
+  end
+end

spec/sorting_algorithms/bubble_sort_spec.rb

@@ -3,20 +3,5 @@
 require "spec_helper"
 
 RSpec.describe(SortingAlgorithms::BubbleSort) do
-  describe ".call" do
-    it "returns an ascending sorted array" do
-      expect(described_class.call([10, 4, 8, 3, 11]))
-        .to(eq([3, 4, 8, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with repeating numbers" do
-      expect(described_class.call([10, 10, 8, 8, 11]))
-        .to(eq([8, 8, 10, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with zeros and negative numbers" do
-      expect(described_class.call([0, -1, -20, 8, 11]))
-        .to(eq([-20, -1, 0, 8, 11]))
-    end
-  end
+  it_behaves_like "a sorting algorithm"
 end

spec/sorting_algorithms/insertion_sort_spec.rb

@@ -3,20 +3,5 @@
 require "spec_helper"
 
 RSpec.describe(SortingAlgorithms::InsertionSort) do
-  describe ".call" do
-    it "returns an ascending sorted array" do
-      expect(described_class.call([10, 4, 8, 3, 11]))
-        .to(eq([3, 4, 8, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with repeating numbers" do
-      expect(described_class.call([10, 10, 8, 8, 11]))
-        .to(eq([8, 8, 10, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with zeros and negative numbers" do
-      expect(described_class.call([0, -1, -20, 8, 11]))
-        .to(eq([-20, -1, 0, 8, 11]))
-    end
-  end
+  it_behaves_like "a sorting algorithm"
 end

spec/sorting_algorithms/merge_sort_spec.rb

@@ -3,20 +3,5 @@
 require "spec_helper"
 
 RSpec.describe(SortingAlgorithms::MergeSort) do
-  describe ".call" do
-    it "return an ascending sorted array" do
-      expect(described_class.call([10, 4, 8, 3, 11]))
-        .to(eq([3, 4, 8, 10, 11]))
-    end
-
-    it "return an ascending sorted array with repeating numbers" do
-      expect(described_class.call([10, 10, 8, 8, 11]))
-        .to(eq([8, 8, 10, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with zeros and negative numbers" do
-      expect(described_class.call([0, -1, -20, 8, 11]))
-        .to(eq([-20, -1, 0, 8, 11]))
-    end
-  end
+  it_behaves_like "a sorting algorithm"
 end

spec/sorting_algorithms/quick_sort_spec.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+require "spec_helper"
+
+RSpec.describe(SortingAlgorithms::QuickSort) do
+  it_behaves_like "a sorting algorithm"
+end

spec/sorting_algorithms/selection_sort_spec.rb

@@ -3,20 +3,5 @@
 require "spec_helper"
 
 RSpec.describe(SortingAlgorithms::SelectionSort) do
-  describe ".call" do
-    it "return an ascending sorted array" do
-      expect(described_class.call([10, 4, 8, 3, 11]))
-        .to(eq([3, 4, 8, 10, 11]))
-    end
-
-    it "return an ascending sorted array with repeating numbers" do
-      expect(described_class.call([10, 10, 8, 8, 11]))
-        .to(eq([8, 8, 10, 10, 11]))
-    end
-
-    it "returns an ascending sorted array with zeros and negative numbers" do
-      expect(described_class.call([0, -1, -20, 8, 11]))
-        .to(eq([-20, -1, 0, 8, 11]))
-    end
-  end
+  it_behaves_like "a sorting algorithm"
 end

spec/spec_helper.rb

@@ -23,4 +23,6 @@
   # Executa os testes em ordem aleatória para detectar dependências ocultas
   config.order = :random
   Kernel.srand(config.seed)
+
+  Dir[File.join(__dir__, "support/**/*.rb")].sort.each { |f| require f }
 end

spec/support/shared_examples/sorting_algorithms.rb

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+RSpec.shared_examples("a sorting algorithm") do
+  describe ".call" do
+    it "returns an ascending sorted array" do
+      expect(described_class.call([10, 4, 8, 3, 11]))
+        .to(eq([3, 4, 8, 10, 11]))
+    end
+
+    it "returns an ascending sorted array with repeating numbers" do
+      expect(described_class.call([10, 10, 8, 8, 11]))
+        .to(eq([8, 8, 10, 10, 11]))
+    end
+
+    it "returns an ascending sorted array with zeros and negative numbers" do
+      expect(described_class.call([0, -1, -20, 8, 11]))
+        .to(eq([-20, -1, 0, 8, 11]))
+    end
+  end
+end