algorithmable 0.13.0 → 0.14.0

data/lib/algorithmable/sort/quick_sort.rb

@@ -0,0 +1,35 @@
+module Algorithmable
+  module Sort
+    class QuickSort
+      extend Algorithmable::Sort::Utils
+
+      def self.sort(collection)
+        do_effect(collection, 0, collection.length - 1)
+      end
+
+      private
+
+      def self.do_effect(collection, lo, hi)
+        return collection if hi <= lo
+        lo_or_hi = partition(collection, lo, hi)
+        do_effect(collection, lo, lo_or_hi - 1)
+        do_effect(collection, lo_or_hi + 1, hi)
+      end
+
+      # private
+      #
+      # def self.partition(ary, from, to)
+      #   pivot = ary[from]
+      #   i = from + 1
+      #   (from + 1).upto(to).each do |j|
+      #     if ary[j] < pivot
+      #       ary[i], ary[j] = ary[j], ary[i]
+      #       i += 1
+      #     end
+      #   end
+      #   ary[i-1], ary[from] = ary[from], ary[i-1]
+      #   i
+      # end
+    end
+  end
+end

data/lib/algorithmable/sort/selection.rb

@@ -0,0 +1,23 @@
+module Algorithmable
+  module Sort
+    class Selection
+      extend Algorithmable::Sort::Utils
+      # Does sorting in O(n2) time (quadratic time)
+      #
+      def self.sort(collection)
+        return collection if collection.empty? || 1 >= collection.length
+        length = collection.length - 1
+
+        0.upto(length).each do |i|
+          min = i
+          (1 + i).upto(length).each do |j|
+            min = j if collection[j] < collection[min]
+          end
+          exchange(i, min, collection)
+        end
+
+        collection
+      end
+    end
+  end
+end

data/lib/algorithmable/sort/shell.rb

@@ -0,0 +1,27 @@
+module Algorithmable
+  module Sort
+    class Shell
+      extend Algorithmable::Sort::Utils
+      def self.sort(collection)
+        return collection if 2 > collection.length
+        length = collection.length
+        h = 1
+
+        h = 3 * h + 1 while h < length / 3
+
+        while h >= 1
+          h.upto(length - 1).each do |i|
+            j = i
+            while j >= h && collection[j] < collection[j - h]
+              exchange(j, j - h, collection)
+              j -= h
+            end
+          end
+          h /= 3
+        end
+
+        collection
+      end
+    end
+  end
+end

data/lib/algorithmable/sort/shuffle.rb

@@ -0,0 +1,15 @@
+module Algorithmable
+  module Sort
+    class Shuffle
+      extend Algorithmable::Sort::Utils
+
+      def self.sort(collection)
+        return collection if collection.empty? || 2 > collection.length
+        collection.length.times do |i|
+          exchange(i, rand(i + 1), collection)
+        end
+        collection
+      end
+    end
+  end
+end

data/lib/algorithmable/sort/utils.rb

@@ -0,0 +1,66 @@
+module Algorithmable
+  module Sort
+    module Utils
+      # @param [Integer] a
+      # @param [Integer] bottom
+      # @param [Array] top
+      # @return [Integer] Integer representing new pivot location
+      def partition(a, bottom, top)
+        i = bottom
+        j = top.succ
+        v = a[bottom]
+        loop do
+          while a[i += 1] < v
+            break if i == top
+          end
+          while v < a[j -= 1]
+            break if j == bottom
+          end
+          break if i >= j
+          cur_i = a[i]
+          a[i] = a[j]
+          a[j] = cur_i
+        end
+        cur_bottom = a[bottom]
+        a[bottom] = a[j]
+        a[j] = cur_bottom
+        j
+      end
+
+      # def partition(ary, from, to)
+      #   pivot = ary[from]
+      #   i = from + 1
+      #   (from + 1).upto(to).each do |j|
+      #     if ary[j] < pivot
+      #       ary[i], ary[j] = ary[j], ary[i]
+      #       i += 1
+      #     end
+      #   end
+      #   ary[i-1], ary[from] = ary[from], ary[i-1]
+      #   i
+      # end
+
+      # @param [Integer] from
+      # @param [Integer] to
+      # @param [Array] collection
+      # @return [Object]
+      def exchange(from, to, collection)
+        return collection if from == to
+        local_from = collection[from]
+        collection[from] = collection[to]
+        collection[to] = local_from
+        collection
+      end
+
+      # @param [Integer] collection
+      # @param [Integer] i
+      # @return [Array] collection
+      def swap(collection, i)
+        current = collection[i]
+        collection[i] = collection[i + 1]
+        collection[i + 1] = current
+        collection
+      end
+    end
+  end
+end

data/lib/algorithmable/sort.rb

@@ -1,10 +1,22 @@
 module Algorithmable
   module Sort
+    autoload :Utils, 'algorithmable/sort/utils'
+    autoload :Selection, 'algorithmable/sort/selection'
+    autoload :Insertion, 'algorithmable/sort/insertion'
+    autoload :Shell, 'algorithmable/sort/shell'
+    autoload :Shuffle, 'algorithmable/sort/shuffle'
     autoload :Merge, 'algorithmable/sort/merge'
     autoload :Bubble, 'algorithmable/sort/bubble'
     autoload :BinaryHeap, 'algorithmable/sort/binary_heap'
+    autoload :QuickSort, 'algorithmable/sort/quick_sort'
+
+    private_constant :Merge, :Bubble, :BinaryHeap, :Insertion, :QuickSort, :Selection
 
     class << self
+      def quick(collection)
+        QuickSort.sort(collection)
+      end
+
       def merge(collection)
         Merge.sort(collection)
       end
@@ -16,6 +28,22 @@ module Algorithmable
       def binary_heap(collection)
         BinaryHeap.sort(collection)
       end
+
+      def selection(container)
+        Selection.sort(container)
+      end
+
+      def insertion(collection)
+        Insertion.sort(collection)
+      end
+
+      def shell(collection)
+        Shell.sort(collection)
+      end
+
+      def shuffle(collection)
+        Shuffle.sort(collection)
+      end
     end
   end
 end

data/lib/algorithmable/union_find.rb

@@ -0,0 +1,51 @@
+module Algorithmable
+  module UnionFind
+    def self.new(quantity)
+      Impl.new(quantity)
+    end
+
+    class Impl
+      attr_reader :quantity
+
+      def initialize(quantity, find_strategy = SimpleFind.new, union_strategy = SimpleUnion.new)
+        @index = (0..quantity).to_a
+        @quantity = quantity
+        @find_strategy = find_strategy
+        @union_strategy = union_strategy
+      end
+
+      def find(p)
+        @find_strategy.find(p, @index)
+      end
+
+      def union(p1, p2)
+        @union_strategy.union(p1, p2, @index)
+        @quantity -= 1
+      end
+
+      def connected?(p1, p2)
+        find(p1) == find(p2)
+      end
+    end
+
+    class SimpleFind
+      def find(p, collection)
+        collection[p]
+      end
+    end
+
+    class SimpleUnion
+      def union(p1, p2, collection)
+        p1_id = collection[p1]
+        p2_id = collection[p2]
+        return collection if p1_id == p2_id
+        collection.each_index do |i|
+          collection[i] = p2_id if collection[i] == p1_id
+        end
+        collection
+      end
+    end
+
+    private_constant :Impl, :SimpleFind, :SimpleUnion
+  end
+end

data/lib/algorithmable/version.rb

@@ -1,3 +1,3 @@
 module Algorithmable
-  VERSION = '0.13.0'
+  VERSION = '0.14.0'
 end

data/lib/algorithmable.rb

@@ -13,6 +13,8 @@ module Algorithmable
   autoload :Puzzles, 'algorithmable/puzzles'
   autoload :LevenshteinDistance, 'algorithmable/levenshtein_distance'
   autoload :Cups, 'algorithmable/cups'
+  autoload :Cache, 'algorithmable/cache'
+  autoload :UnionFind, 'algorithmable/union_find'
 
   class << self
     def logger

data/script/benchmarks/sort.rb

@@ -0,0 +1,37 @@
+#! /usr/bin/env ruby
+
+require 'bundler/setup'
+require 'algorithmable'
+require 'rbench'
+
+job = lambda do |*_args|
+  sorter = Algorithmable::Sort
+  n = 1000
+  column_names = %w(selection insertion shell bubble merge quick  binary_heap ruby)
+
+  f = -> (name) { public_send :column, name.to_sym }
+  column_names.each(&f)
+
+  g = lambda do |scope, ary|
+    scope.selection { sorter.selection(ary.dup) }
+    scope.insertion { sorter.insertion(ary.dup) }
+    scope.shell { sorter.shell(ary.dup) }
+    scope.bubble { sorter.bubble(ary.dup) }
+    scope.merge { sorter.merge(ary.dup) }
+    scope.quick { sorter.quick(ary.dup) }
+    scope.binary_heap { sorter.binary_heap(ary.dup) }
+    scope.ruby { ary.dup.sort }
+  end
+
+  report :presorted do
+    sorted_array = (0..n).to_a
+    g.call(self, sorted_array)
+  end
+
+  report :shuffled do
+    random_array = (0..n).to_a.shuffle
+    g.call(self, random_array)
+  end
+end
+
+RBench.run(5, &job)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithmable
 version: !ruby/object:Gem::Version
-  version: 0.13.0
+  version: 0.14.0
 platform: ruby
 authors:
 - Roman Lishtaba
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-01-17 00:00:00.000000000 Z
+date: 2016-05-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -122,6 +122,20 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '0.8'
+- !ruby/object:Gem::Dependency
+  name: rbench
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: Useful algorithms for everyday usage implemented using Ruby.
 email:
 - roman@lishtaba.com
@@ -140,8 +154,27 @@ files:
 - algorithmable.gemspec
 - cucumber.yml
 - lib/algorithmable.rb
+- lib/algorithmable/cache.rb
+- lib/algorithmable/cache/imp.rb
+- lib/algorithmable/cache/primitive_max_heap.rb
+- lib/algorithmable/cache/primitive_min_heap.rb
 - lib/algorithmable/cups.rb
+- lib/algorithmable/cups/circular_dependencies.rb
+- lib/algorithmable/cups/longest_common_subsequence.rb
+- lib/algorithmable/cups/merge_two_arrays.rb
+- lib/algorithmable/cups/nested_lists_problem.rb
+- lib/algorithmable/cups/number_of_occurrences_in_array.rb
 - lib/algorithmable/cups/primitives.rb
+- lib/algorithmable/cups/root_cube_issue.rb
+- lib/algorithmable/cups/stacks_and_queues.rb
+- lib/algorithmable/cups/stacks_and_queues/stack_sorter.rb
+- lib/algorithmable/cups/stacks_and_queues/stack_with_min.rb
+- lib/algorithmable/cups/stacks_and_queues/towers_of_hanoi.rb
+- lib/algorithmable/cups/stacks_and_queues/triple_stack.rb
+- lib/algorithmable/cups/stacks_and_queues/two_stacks_queue.rb
+- lib/algorithmable/cups/stocks.rb
+- lib/algorithmable/cups/task_shedule_with_coldtime.rb
+- lib/algorithmable/cups/two_sum.rb
 - lib/algorithmable/data_structs.rb
 - lib/algorithmable/data_structs/bag.rb
 - lib/algorithmable/data_structs/deque.rb
@@ -156,6 +189,9 @@ files:
 - lib/algorithmable/data_structs/ordered_symbol_table.rb
 - lib/algorithmable/data_structs/queue.rb
 - lib/algorithmable/data_structs/stack.rb
+- lib/algorithmable/data_structs/tree.rb
+- lib/algorithmable/data_structs/tree/binary.rb
+- lib/algorithmable/data_structs/tree/binary_search.rb
 - lib/algorithmable/errors.rb
 - lib/algorithmable/graphs.rb
 - lib/algorithmable/graphs/traversals.rb
@@ -172,8 +208,16 @@ files:
 - lib/algorithmable/sort.rb
 - lib/algorithmable/sort/binary_heap.rb
 - lib/algorithmable/sort/bubble.rb
+- lib/algorithmable/sort/insertion.rb
 - lib/algorithmable/sort/merge.rb
+- lib/algorithmable/sort/quick_sort.rb
+- lib/algorithmable/sort/selection.rb
+- lib/algorithmable/sort/shell.rb
+- lib/algorithmable/sort/shuffle.rb
+- lib/algorithmable/sort/utils.rb
+- lib/algorithmable/union_find.rb
 - lib/algorithmable/version.rb
+- script/benchmarks/sort.rb
 - script/console
 homepage: ''
 licenses: