quicksort 1.0.0

data/lib/qs.rb

@@ -0,0 +1,18 @@
+class Quicksort
+  def self.qs (array)
+    if array.length <= 1
+      return array
+    end
+    less = Array.new
+    greater = Array.new
+    pivot = array.delete_at(array.length/2)
+    array.each do |x|
+      if x < pivot
+        less << x
+      else
+        greater << x
+      end
+    end
+    return (self.qs(less) << pivot << self.qs(greater)).flatten.compact
+  end
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: quicksort
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+  prerelease: 
+platform: ruby
+authors:
+- Jons Hugger
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-12-30 00:00:00.000000000 Z
+dependencies: []
+description: lightweight implementation of the quicksort algorithm
+email: jona@kyr.li
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/qs.rb
+homepage: http://rubygems.org/gems/quicksort
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: lightweight implementation of the quicksort algorithm
+test_files: []