brutish_sorts 1.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 8f0c598a0a8ab6d06851a2dda378255d23fcf3f5
+  data.tar.gz: ccdf9dd3e1fdba4b73723c2cf656f8d571a79516
+SHA512:
+  metadata.gz: c3e262e6c2058182fa5251dcfc7c2c8a220c83a0bb4f202eb5eb9466c57f5309db8b9185d76ffd5b0db0b29a6e468dfbbe18ebf318b511eb6f315196f7d95392
+  data.tar.gz: 9ae35cdf6399e22fb7d2c6ffb4414667d572607b28052904aa11379de70ecf8adc23dc9c1c71d937cc0cc91541d4fa69e7d6e6176a7408faef682e900252336a

data/lib/brutish_sorts.rb

@@ -0,0 +1,34 @@
+require 'brutish_sorts/core'
+require 'brutish_sorts/selection_sort'
+
+module BrutishSorts
+  extend self
+
+  def selection_sort(array)
+    dup = array.dup
+    pivot = 0
+    for i in 0..dup.length - 1
+      pivot = SelectionSort.min_index(dup,i)
+      dup = SelectionSort.swap(dup,pivot,i)
+    end
+    dup
+  end
+
+  def insertion_sort(array)
+    dup = array.dup
+    tmp = 0
+    0.upto(dup.length - 1) do |a|
+      a.downto(0) do |b|
+        if b < (dup.length - 1)
+          if dup[b + 1] < dup[b]
+            tmp = dup[b]
+            dup[b] = dup[b + 1]
+            dup[b + 1] = tmp
+          end
+        end
+      end
+    end
+    dup
+  end
+
+end

data/lib/brutish_sorts/core.rb

@@ -0,0 +1,9 @@
+module Enumerable
+  def selection_sort
+    BrutishSorts.selection_sort(self)
+  end
+
+  def insertion_sort
+    BrutishSorts.insertion_sort(self)
+  end
+end

data/lib/brutish_sorts/selection_sort.rb

@@ -0,0 +1,23 @@
+class SelectionSort
+  
+  def self.swap(array, pivot, index)
+    temp = array[pivot]
+    array[pivot] = array[index]
+    array[index] = temp
+    array
+  end
+
+  def self.min_index(array, start_index)
+    min_value = array[start_index]
+    min_index = start_index
+    si_1 = start_index + 1
+
+    for a in si_1..array.length - 1
+      if array[a] < min_value
+        min_index = a
+        min_value = array[a]
+      end
+    end
+    min_index
+  end
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: brutish_sorts
+version: !ruby/object:Gem::Version
+  version: 1.1.0
+platform: ruby
+authors:
+- Josiah Siegel
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-03-15 00:00:00.000000000 Z
+dependencies: []
+description: 'Unpolished sorts: selection sort, insertion sort'
+email: josiah0601@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/brutish_sorts.rb
+- lib/brutish_sorts/core.rb
+- lib/brutish_sorts/selection_sort.rb
+homepage: http://rubygems.org/gems/brutish_sorts
+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.4.5
+signing_key: 
+specification_version: 4
+summary: Brutish Sorts
+test_files: []