pavsort 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: da78c0f4070165bee47b967761ac59d9cc8062f7
+  data.tar.gz: b46e4d9594f661f330dfecabd8ea851d1de39f6f
+SHA512:
+  metadata.gz: f1f6f26088e9763b4650d9ef5ce7c1229a11fdefe733173c0383e50e1ad7f19eb528e1c5d7fa5af27ffbd55d429f467edb83c24f9d26ac73b539de2a765c22a9
+  data.tar.gz: 52689038148ae38eb3743d2e5dac7a6c9dcc167a7b35cfe85c37cfe4ac7f253d6c2e19faa6f9284f5f2877e06381d6c72cba5f57383e22424491d7adeec560dd

data/lib/pavsort.rb

@@ -0,0 +1,82 @@
+module Pavsort
+  class Merge
+    class << self
+
+      def sort(array)
+        part = array.partition{|element| element.respond_to?(:/)}
+        num_sort(part.first) + alph_sort(part.last)
+      end
+
+      private
+
+      def alph_sort(array)
+        return array if array.length <= 1
+        first_half, second_half = split_array_in_half(array)
+        return alph_merge(alph_sort(first_half),alph_sort(second_half))
+      end
+
+      def num_sort(array)
+        return array if array.length <= 1
+        first_half, second_half = split_array_in_half(array)
+        return num_merge(num_sort(first_half),num_sort(second_half))
+      end
+
+      def split_array_in_half(array)
+      	mid_index = array.length / 2
+      	[array.take(mid_index), array.drop(mid_index)]
+      end
+
+      def alph_merge(left, right)
+      	result = []
+      	until left.empty? && right.empty?
+      		case 
+      			when left.empty? then result << right.shift
+      			when right.empty? then result << left.shift
+      			when left.first.downcase < right.first.downcase then result << left.shift
+      			when right.first.downcase < left.first.downcase then result << right.shift
+      		end
+      	end
+      	result
+      end
+
+      def num_merge(left, right)
+        result = []
+        until left.empty? && right.empty?
+          case 
+            when left.empty? then result << right.shift
+            when right.empty? then result << left.shift
+            when left.first < right.first then result << left.shift
+            when right.first < left.first then result << right.shift
+          end
+        end
+         result
+      end
+    end
+  end
+
+  class Quick
+    class << self
+
+      def sort(array)
+        part = array.partition{|element| element.respond_to?(:/)}
+        num_sort(part.first) + alph_sort(part.last)
+      end
+
+      private
+
+      def num_sort(array)
+        return array if array.length <= 1
+          pivot = array.delete_at(rand(array.length))
+          partition = array.partition{|element| element < pivot}
+          num_sort(partition.first) + [pivot] + num_sort(partition.last)
+      end
+
+      def alph_sort(array)
+        return array if array.length <= 1
+        pivot = array.delete_at(rand(array.length))
+        partition = array.partition{|element| element.downcase < pivot.downcase}
+        alph_sort(partition.first) + [pivot] + alph_sort(partition.last)
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,45 @@
+--- !ruby/object:Gem::Specification
+name: pavsort
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Phil Vargas
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-04-07 00:00:00.000000000 Z
+dependencies: []
+description: Merge sort and Quick sort methods implemented in ruby. Methods are case
+  and numerically insensitive
+email: ''
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/pavsort.rb
+homepage: http://rubygems.org/gems/pavsort
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.1
+signing_key: 
+specification_version: 4
+summary: Implementation of various numerically-and-case-insensitive Sorting Methods
+test_files: []