kata-algorithms 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 90aac947c57fde27f904e20c09ae9276ae21f3b4
+  data.tar.gz: 0ebcc3abc31c17bfed448377b3dab7a38019c505
+SHA512:
+  metadata.gz: e8ce09b15a615dc8c1f1af17fd194e760f48cc7ff4f61a7a5aac09ef828a97d5ec8cc692d00cf97c592ea3b5b6a6626c41a0caf8e6471020283214afa34f436c
+  data.tar.gz: 26624f7cfee3cec901b680c3477d52d5716beae2df75b97c1fda9cbbca2ec14a2ece0f53778b887fb5157edb07914249a9fd6e058fce3fba324c9c73135d3c0c

data/.gitignore

@@ -0,0 +1,18 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+.idea

data/.rvmrc

@@ -0,0 +1,62 @@
+#!/usr/bin/env bash
+
+# This is an RVM Project .rvmrc file, used to automatically load the ruby
+# development environment upon cd'ing into the directory
+
+# First we specify our desired <ruby>[@<gemset>], the @gemset name is optional,
+# Only full ruby name is supported here, for short names use:
+#     echo "rvm use 2.0.0" > .rvmrc
+environment_id="ruby-2.0.0-p247@kata-algorithms"
+
+# Uncomment the following lines if you want to verify rvm version per project
+# rvmrc_rvm_version="1.22.3 (stable)" # 1.10.1 seems like a safe start
+# eval "$(echo ${rvm_version}.${rvmrc_rvm_version} | __rvm_awk -F. '{print "[[ "$1*65536+$2*256+$3" -ge "$4*65536+$5*256+$6" ]]"}' )" || {
+#   echo "This .rvmrc file requires at least RVM ${rvmrc_rvm_version}, aborting loading."
+#   return 1
+# }
+
+# First we attempt to load the desired environment directly from the environment
+# file. This is very fast and efficient compared to running through the entire
+# CLI and selector. If you want feedback on which environment was used then
+# insert the word 'use' after --create as this triggers verbose mode.
+if [[ -d "${rvm_path:-$HOME/.rvm}/environments"
+  && -s "${rvm_path:-$HOME/.rvm}/environments/$environment_id" ]]
+then
+  \. "${rvm_path:-$HOME/.rvm}/environments/$environment_id"
+  for __hook in "${rvm_path:-$HOME/.rvm}/hooks/after_use"*
+  do
+    if [[ -f "${__hook}" && -x "${__hook}" && -s "${__hook}" ]]
+    then \. "${__hook}" || true
+    fi
+  done
+  unset __hook
+  if (( ${rvm_use_flag:=1} >= 2 )) # display only when forced
+  then
+    if [[ $- == *i* ]] # check for interactive shells
+    then printf "%b" "Using: \E[32m$GEM_HOME\E[0m
+" # show the user the ruby and gemset they are using in green
+    else printf "%b" "Using: $GEM_HOME
+" # don't use colors in non-interactive shells
+    fi
+  fi
+else
+  # If the environment file has not yet been created, use the RVM CLI to select.
+  rvm --create  "$environment_id" || {
+    echo "Failed to create RVM environment '${environment_id}'."
+    return 1
+  }
+fi
+
+# If you use bundler, this might be useful to you:
+# if [[ -s Gemfile ]] && {
+#   ! builtin command -v bundle >/dev/null ||
+#   builtin command -v bundle | GREP_OPTIONS="" \grep $rvm_path/bin/bundle >/dev/null
+# }
+# then
+#   printf "%b" "The rubygem 'bundler' is not installed. Installing it now.\n"
+#   gem install bundler
+# fi
+# if [[ -s Gemfile ]] && builtin command -v bundle >/dev/null
+# then
+#   bundle install | GREP_OPTIONS="" \grep -vE '^Using|Your bundle is complete'
+# fi

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in kata-algorithms.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 Panayotis Matsinopoulos
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,40 @@
+# Kata::Algorithms
+
+A set of algorithm implementations in Ruby.
+
+While reading the book [Algorithms in a Nutshell](http://www.amazon.com/gp/product/059651624X/ref=as_li_qf_sp_asin_il_tl?ie=UTF8&camp=1789&creative=9325&creativeASIN=059651624X&linkCode=as2&tag=panayotmatsin-20), we have
+decided to implement a set of the algorithms presented there.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'algorithms'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install algorithms
+
+## Usage
+
+If you want to run a set of programs that use the algorithms
+implemented, you can find them in the `bin` folder.
+
+For example:
+
+    bundle exec bin/addition
+
+demonstrates the `Algorithms.addition` algorithm implementation.
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request
+

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/bin/addition

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+
+require "kata/algorithms"
+
+print "Give me the first number: "
+a = gets.strip
+
+print "Give me the second number: "
+b = gets.strip
+
+result = Kata::Algorithms.addition(a, b)
+
+puts "Result is #{result}"
+
+

data/bin/multiplication

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+
+require "kata/algorithms"
+
+print "Give me the first number: "
+a = gets.strip
+
+print "Give me the second number: "
+b = gets.strip
+
+result = Kata::Algorithms.multiplication(a, b)
+
+puts "Result is #{result}"
+
+

data/kata-algorithms.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'kata/algorithms/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "kata-algorithms"
+  spec.version       = Kata::Algorithms::VERSION
+  spec.authors       = ["Panayotis Matsinopoulos"]
+  spec.email         = ["panayotis@matsinopoulos.gr"]
+  spec.description   = %q{A set of algorithms implementation}
+  spec.summary       = %q{A series of algorithms implementation. This is more of a practice while reading books about algorithms}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rspec"
+end

data/lib/kata/algorithms/version.rb

@@ -0,0 +1,5 @@
+module Kata
+  module Algorithms
+    VERSION = "0.0.1"
+  end
+end

data/lib/kata/algorithms.rb

@@ -0,0 +1,134 @@
+require "kata/algorithms/version"
+
+module Kata
+  module Algorithms
+    # ADDITION OF INTEGERS WHEN REPRESENTED AS STRINGS
+    # ================================================
+    #
+    # E.g. "345" + "7890" = "8235"
+    #
+    # Inspired by the book "Algorithms In a Nutshell - Chapter 2 - The Mathematics of Algorithms"
+    #
+    # Assume that we have two integers represented as strings, For example:
+    #
+    #    a = "2382738"
+    #
+    # (a.k.a. `a[1] = "8", a[2] = "3", ... , a[7] = "2"`)
+    #
+    # and
+    #
+    #    b = "9891829"
+    #
+    # (a.k.a. `b[1] = "9", b[2] = "2", ..., b[7] = "9"`)
+    #
+    # Can we calculate their sum, without converting them to integers?
+    #
+    #    c = c[n+1]...c[1] = "12274567"
+    #
+    # (a.k.a. `c[1] = "7", c[2] = "6", ..., c[7] = "2", c[8] = "1"`)
+    #
+    # Or in other words, how one would do this addition on a piece of paper?
+    #
+    # The primitive operations used in this ADDITION algorithm are as follows:
+    #
+    #    c[i] = (a[i] + b[i] + carry[i]) mod 10
+    #    carry[i+1] = (a[i] + b[i] + carry[i]) >= 10 ? 1 : 0
+    #
+    # The above algorithm is implemented in this addition. However,
+    # there is an optimization, because "mod 10" is an expensive operation.
+    # So, we do not use it.
+    #
+    # Also, we have implemented that so that it can work with operands of
+    # different length. So, "a" and 'b" do not have to be of same length.
+    #
+    # @param a [String] An integer represented as string, e.g. "123412"
+    # @param b [String] An integer represented as string, e.g. "3742834"
+    # @return [String]  The string representation of a + b, e.g. "3866246"
+    #
+    def self.addition(a, b)
+      a = a.split('').reverse
+      b = b.split('').reverse
+      carry = 0
+      i = 0
+      c = ""
+
+      # while I have a digit I process it
+      while !a[i].nil? || !b[i].nil?
+        result_on_i = a[i].to_i + b[i].to_i + carry  # .to_i on nil works perfect. returns 0
+        if result_on_i >= 10
+          c = "#{result_on_i - 10}#{c}"
+          carry = 1
+        else
+          c = "#{result_on_i}#{c}"
+          carry = 0
+        end
+        i += 1
+      end
+
+      c = "1#{c}" if carry == 1
+      c == "" ? "0" : c
+    end
+
+    # MULTIPLICATION OF INTEGERS WHEN REPRESENTED AS STRINGS
+    # ======================================================
+    #
+    # E.g. "345" * "7890" = "2722050"
+    #
+    # Inspired by the book "Algorithms In a Nutshell - Chapter 2 - The Mathematics of Algorithms"
+    #
+    # Assume that we have two integers represented as strings, For example:
+    #
+    #    a = "2382738"
+    #
+    # (a.k.a. `a[1] = "8", a[2] = "3", ... , a[7] = "2"`)
+    #
+    # and
+    #
+    #    b = "9891829"
+    #
+    # (a.k.a. `b[1] = "9", b[2] = "2", ..., b[7] = "9"`)
+    #
+    # Can we calculate their multiplication, without converting them to integers?
+    #
+    #    c = c[k]...c[1] = "23569636847802"
+    #
+    # (a.k.a. `c[1] = "2", c[2] = "0", ..., c[k] = "2"`)
+    #
+    #
+    # This MULTIPLICAITON algorithm works, more or less, as follows:
+    #
+    #  assume A X B
+    #
+    # n      scans B from right to left
+    # m      scans A from right to left, for each on of the digits of B
+    # result holds the intermediate and final results
+    #
+    # initialize result to "0"
+    #
+    # for each digit on B starting from least significant to most significant - scan with n
+    #   for each digit on A starting from least significant to most significant - scan with m
+    #     result is increased by B[n] * A[m] * 10^(n+m)
+    #
+    # at the end of the iterations, result will hold the correct answer
+    #
+    # Note that we have not used the native addition operation. We have used the
+    # +Algorithms.addition+ to increase the results.
+    #
+    #
+    # @param a [String] An integer represented as string, e.g. "123412"
+    # @param b [String] An integer represented as string, e.g. "3742834"
+    # @return [String]  The string representation of a + b, e.g. "461910629608"
+    #
+    def self.multiplication(a, b)
+      a = a.split('')
+      b = b.split('')
+      result = "0"
+      (0..b.size-1).step do |n|
+        (0..a.size-1).step  do |m|
+          result = Kata::Algorithms.addition(result, (b[b.size - 1 - n].to_i * a[a.size - 1 -m].to_i * 10 ** (n + m)).to_s)
+        end
+      end
+      result
+    end
+  end
+end

data/spec/kata/algorithms_spec.rb

@@ -0,0 +1,101 @@
+require 'spec_helper'
+
+describe Kata::Algorithms do
+  describe ".addition" do
+    context 'when a is 2' do
+      let(:a) { '2' }
+      context 'when b is 8' do
+        let(:b) { '8' }
+        it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+      end
+      context 'when b is 123' do
+        let(:b) { '123' }
+        it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+      end
+    end
+    context 'when a is 32' do
+      let(:a) { '32' }
+      context 'when b is 8' do
+        let(:b) { '8' }
+        it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+      end
+      context 'when b is 123' do
+        let(:b) { '123' }
+        it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+      end
+      context 'when b is 92' do
+        let(:b) { '92' }
+        it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+      end
+    end
+    context 'when a is 0 and b is 0' do
+      let(:a) { "0" }
+      let(:b) { "0" }
+      it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+    end
+    context 'when a is 0 and b is 20' do
+      let(:a) { "0" }
+      let(:b) { "20" }
+      it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+    end
+    context 'when a is 1 and b is 1' do
+      let(:a) { "0" }
+      let(:b) { "20" }
+      it { expect(subject.addition(a, b)).to eq((a.to_i + b.to_i).to_s) }
+    end
+  end
+
+  describe ".multiplication" do
+    context 'when a is 82 and b is 56' do
+      let(:a) { "82" }
+      let(:b) { "56" }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 2 and b is 10' do
+      let(:a) { "2" }
+      let(:b) { "10" }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 583 and b is 267' do
+      let(:a) { "583" }
+      let(:b) { "267" }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 0 and b is 0' do
+      let(:a) { "0" }
+      let(:b) { "0" }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context "when a is 20 and b is 0" do
+      let(:a) { "20" }
+      let(:b) { "0"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 1 and b is 1' do
+      let(:a) { "1" }
+      let(:b) { "1"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 1 and b is 0' do
+      let(:a) { "1" }
+      let(:b) { "0"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 1 and b is 1000' do
+      let(:a) { "1" }
+      let(:b) { "1000"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 345 and b is 7890' do
+      let(:a) { "345" }
+      let(:b) { "7890"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+    context 'when a is 123481023412304981230491234 and b is 123094812309481239481239048123401948123' do
+      let(:a) { "123481023412304981230491234" }
+      let(:b) { "123094812309481239481239048123401948123"  }
+      it { expect(subject.multiplication(a, b)).to eq((a.to_i * b.to_i).to_s) }
+    end
+  end
+end
+

data/spec/spec_helper.rb

@@ -0,0 +1,2 @@
+require 'kata/algorithms'
+

metadata

@@ -0,0 +1,90 @@
+--- !ruby/object:Gem::Specification
+name: kata-algorithms
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Panayotis Matsinopoulos
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-12-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  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: A set of algorithms implementation
+email:
+- panayotis@matsinopoulos.gr
+executables:
+- addition
+- multiplication
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rvmrc
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/addition
+- bin/multiplication
+- kata-algorithms.gemspec
+- lib/kata/algorithms.rb
+- lib/kata/algorithms/version.rb
+- spec/kata/algorithms_spec.rb
+- spec/spec_helper.rb
+homepage: ''
+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.0.3
+signing_key: 
+specification_version: 4
+summary: A series of algorithms implementation. This is more of a practice while reading
+  books about algorithms
+test_files:
+- spec/kata/algorithms_spec.rb
+- spec/spec_helper.rb