all tasks

Task/Sorting-algorithms-Quicksort/Ruby/sorting-algorithms-quicksort-1.rb

@@ -0,0 +1,9 @@
+class Array
+  def quick_sort
+    return self if length <= 1
+    pivot = self[length / 2]
+    find_all { |i| i <  pivot }.quick_sort +
+      find_all { |i| i == pivot } +
+      find_all { |i| i >  pivot }.quick_sort
+  end
+end

Task/Sorting-algorithms-Quicksort/Ruby/sorting-algorithms-quicksort-2.rb

@@ -0,0 +1,10 @@
+class Array
+  def quick_sort
+    return self if length <= 1
+    pivot = self[0]
+    less, greatereq = self[1..-1].partition { |x| x < pivot }
+    less.quick_sort +
+      [pivot] +
+      greatereq.quick_sort
+  end
+end