algorithm_selector 0.1.3 → 0.1.4

data/doc/top-level-namespace.html

@@ -88,7 +88,7 @@
     
   
     
-      <strong class="classes">Classes:</strong> <span class='object_link'><a href="BSTNode.html" title="BSTNode (class)">BSTNode</a></span>, <span class='object_link'><a href="BinaryTree.html" title="BinaryTree (class)">BinaryTree</a></span>, <span class='object_link'><a href="LinkNode.html" title="LinkNode (class)">LinkNode</a></span>, <span class='object_link'><a href="LinkedList.html" title="LinkedList (class)">LinkedList</a></span>, <span class='object_link'><a href="Queue.html" title="Queue (class)">Queue</a></span>, <span class='object_link'><a href="Searches.html" title="Searches (class)">Searches</a></span>, <span class='object_link'><a href="Sorts.html" title="Sorts (class)">Sorts</a></span>, <span class='object_link'><a href="Stack.html" title="Stack (class)">Stack</a></span>
+      <strong class="classes">Classes:</strong> <span class='object_link'><a href="BSTNode.html" title="BSTNode (class)">BSTNode</a></span>, <span class='object_link'><a href="BinaryMinHeap.html" title="BinaryMinHeap (class)">BinaryMinHeap</a></span>, <span class='object_link'><a href="BinaryTree.html" title="BinaryTree (class)">BinaryTree</a></span>, <span class='object_link'><a href="LinkNode.html" title="LinkNode (class)">LinkNode</a></span>, <span class='object_link'><a href="LinkedList.html" title="LinkedList (class)">LinkedList</a></span>, <span class='object_link'><a href="Queue.html" title="Queue (class)">Queue</a></span>, <span class='object_link'><a href="Searches.html" title="Searches (class)">Searches</a></span>, <span class='object_link'><a href="Sorts.html" title="Sorts (class)">Sorts</a></span>, <span class='object_link'><a href="Stack.html" title="Stack (class)">Stack</a></span>
     
   
 </p>
@@ -104,7 +104,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:45:47 2016 by
+  Generated on Sat Jul 30 20:58:51 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/lib/algorithm_selector.rb

@@ -62,7 +62,8 @@ class Sorts
         insertion_sort: display_time(Proc.new {insertion_sort(data_set)}, trials),
         selection_sort: display_time(Proc.new {selection_sort(data_set)}, trials),
         merge_sort: display_time(Proc.new {merge_sort(data_set)}, trials),
-        quick_sort: display_time(Proc.new {quick_sort(data_set)}, trials)
+        quick_sort: display_time(Proc.new {quick_sort(data_set)}, trials),
+        heap_sort: display_time(Proc.new {heap_sort(data_set)}, trials)
       }
     }
   end
@@ -197,6 +198,21 @@ class Sorts
     right = data_set.select {|el| el > pivot}
     quick_sort(left) + [pivot] + quick_sort(right)
   end
+
+  # Quick sort
+  # Worst-Case Space Complexity: O(1)
+  # Averge-Case Time Complexity: O(n log(n))
+  # Worst-Case Time Complexity: O(n log(n))
+  def heap_sort(data_set)
+    (2..data_set.length).to_a.each do |idx|
+      BinaryMinHeap.heapify_up(data_set, idx - 1, idx)
+    end
+    (2..data_set.length).to_a.reverse.each do |idx|
+      data_set[idx - 1], data_set[0] = data_set[0], data_set[idx - 1]
+      BinaryMinHeap.heapify_down(data_set, 0, idx - 1)
+    end
+    data_set.reverse!
+  end
 end
 
 # Searches class
@@ -570,3 +586,90 @@ class BSTNode
     @right = right
   end
 end
+
+# MinHeap helper class for Heap Sort
+class BinaryMinHeap
+  def initialize(&prc)
+    @store = []
+    @prc = prc || Proc.new { |el1, el2| el1 <=> el2 }
+  end
+
+  def count
+    @store.length
+  end
+
+  def extract
+    raise "no element to extract" if count == 0
+    val = @store[0]
+    @store.pop if count == 1
+    if count > 1
+      @store[0] = @store.pop
+      self.class.heapify_down(@store, 0, &@prc)
+    end
+    val
+  end
+
+  def peek
+    raise "no element to peek" if count == 0
+    @store[0]
+  end
+
+  def push(val)
+    @store.push(val)
+    self.class.heapify_up(@store, count - 1, &@prc)
+  end
+
+  protected
+  attr_accessor :prc, :store
+
+  public
+  def self.child_indices(len, parent_index)
+    [2 * parent_index + 1, 2 * parent_index + 2].select { |idx| idx < len }
+  end
+
+  def self.parent_index(child_index)
+    raise "root has no parent" if child_index == 0
+    (child_index - 1) / 2
+  end
+
+  def self.heapify_down(array, parent_idx, len = array.length, &prc)
+    prc ||= Proc.new { |el1, el2| el1 <=> el2 }
+
+    left_child, right_child = child_indices(len, parent_idx)
+
+    parent = array[parent_idx]
+
+    children = []
+    children.push(array[left_child]) if left_child
+    children.push(array[right_child]) if right_child
+
+    if children.all? { |child| prc.call(parent, child) <= 0 }
+      return array
+    end
+
+    swap_idx = nil
+    if children.length == 1
+      swap_idx = left_child
+    else
+      swap_idx =
+        prc.call(children[0], children[1]) == -1 ? left_child : right_child
+    end
+
+    array[parent_idx], array[swap_idx] = array[swap_idx], parent
+    heapify_down(array, swap_idx, len, &prc)
+  end
+
+  def self.heapify_up(array, child_idx, len = array.length, &prc)
+    prc ||= Proc.new { |el1, el2| el1 <=> el2 }
+    return array if child_idx == 0
+
+    parent_idx = parent_index(child_idx)
+    child, parent = array[child_idx], array[parent_idx]
+    if prc.call(child, parent) >= 0
+      return array
+    else
+      array[child_idx], array[parent_idx] = parent, child
+      heapify_up(array, parent_idx, len, &prc)
+    end
+  end
+end

data/lib/algorithm_selector/version.rb

@@ -1,3 +1,3 @@
 module AlgorithmSelector
-  VERSION = "0.1.3"
+  VERSION = "0.1.4"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithm_selector
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.1.4
 platform: ruby
 authors:
 - joseph
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-07-24 00:00:00.000000000 Z
+date: 2016-07-31 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler