combination-pairs 0.0.1

data/.gitignore

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

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 TODO: Write your name
+
+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,54 @@
+# Combination::Pairs
+
+Input: K, N (where 0 < N < ∞, 0 < K < ∞, and K <= N)
+Output: Number of possible equations of K numbers whose sum is N
+
+Example Input:
+N=10 K=3
+Example Output:
+Total unique equations = 8
+  1 + 1 + 8 = 10
+  1 + 2 + 7 = 10
+  1 + 3 + 6 = 10
+  1 + 4 + 5 = 10
+  2 + 2 + 6 = 10
+  2 + 3 + 5 = 10
+  2 + 4 + 4 = 10
+  3 + 3 + 4 = 10
+For reference, N=100, K=3 should have a result of 833 unique sets 
+
+Its performance is better than the repeated-combination of array module but need to be optimized. So please contribute in it make it more optimized.
+
+Now it is working for k =4 and n<1000 and take time for k > 4 so please contribute to make it more effective.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'combination-pairs'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install combination-pairs
+
+## Usage
+
+There are basic two varibales n and k
+n should greater than k
+
+params = {:n =>100, :k =>4}
+c = Combination::Pairs::Equation.new(params)
+c.create_equations
+
+
+## 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/combination-pairs.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'combination/pairs/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "combination-pairs"
+  spec.version       = Combination::Pairs::VERSION
+  spec.authors       = ["Tarun"]
+  spec.email         = ["t.garg28@gmail.com"]
+  spec.description   = %q{K, N (where 0 < N < ∞, 0 < K < ∞, and K <= N)}
+  spec.summary       = %q{Number of possible equations of K numbers whose sum is N}
+  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 "rake"
+end

data/lib/combination/pairs.rb

@@ -0,0 +1,72 @@
+require "combination/pairs/version"
+
+module Combination
+  module Pairs
+    class Equation
+      def initialize(params)
+        @arr=[]
+        @n = params[:n]
+        @k = params[:k]
+      end
+
+      #To create possible equations
+      def create_equations
+        return "Please Enter value of n and k" if @k.blank? && @n.blank?
+        begin
+          Integer(@k)
+        rescue
+          return "Error: Please enter any +ve integer value of k"
+        end
+        begin
+          Integer(@n)
+        rescue
+          return "Error: Please enter any +ve integer value of n"
+        end
+        return "Please enter k < n" if @n < @k
+        create_equations_sum
+      end
+
+      def create_equations_sum
+        aar = []
+        @arr = []
+        @list_elements=(1..@n).to_a
+        (1..@k-1).each do |i|
+          aar << [*0..@n-1]
+        end
+        traverse([], aar, 0)
+        return @arr.uniq #return result
+      end
+
+      #To check sum
+      def generate_sum(*args)
+        new_elements = []
+        total= 0
+        args.flatten.each do |arg|
+          total += @list_elements[arg]
+          new_elements << @list_elements[arg]
+        end
+        if total < @n
+          new_elements << @n - total
+          @arr << new_elements.sort
+        else
+          return
+        end
+      end
+
+      def innerloop(arrayOfCurrentValues)
+        generate_sum(arrayOfCurrentValues)
+      end
+
+      #Recursive method to create dynamic nested loops.
+      def traverse(accumulated,params, index) 
+        if (index==params.size)
+          return innerloop(accumulated) 
+        end
+        currentParam = params[index]
+        currentParam.each do |currentElementOfCurrentParam|
+          traverse(accumulated+[currentElementOfCurrentParam],params, index+1)
+        end
+      end
+    end
+  end
+end

data/lib/combination/pairs/version.rb

@@ -0,0 +1,5 @@
+module Combination
+  module Pairs
+    VERSION = "0.0.1"
+  end
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification
+name: combination-pairs
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Tarun
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-05-24 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: K, N (where 0 < N < ∞, 0 < K < ∞, and K <= N)
+email:
+- t.garg28@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- combination-pairs.gemspec
+- lib/combination/pairs.rb
+- lib/combination/pairs/version.rb
+homepage: ''
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.27
+signing_key: 
+specification_version: 3
+summary: Number of possible equations of K numbers whose sum is N
+test_files: []