kadane_san 0.0.2 → 0.1.0

data/README.md

@@ -2,7 +2,7 @@
 
 [![Build Status](https://travis-ci.org/tsmsogn/kadane_san.svg?branch=master)](https://travis-ci.org/tsmsogn/kadane_san)
 
-Solving maximum subarray problem with Kadane's algorithm
+Solving maximum/minimum subarray problem with Kadane's algorithm
 
 ## Installation
 
@@ -24,9 +24,9 @@ Or install it yourself as:
 
     KadaneSan::max_subarray [-5, -1, 6, 4, 9, -6, -7]
     => 19
-
-    KadaneSan.max_subarray [-4, -2, -3, -1]
-    => -1
+    
+    KadaneSan::min_subarray [5, 1, -6, -4, -9, 6, 7]
+    => -19
 
 ## Contributing
 

data/kadane_san.gemspec

@@ -8,7 +8,7 @@ Gem::Specification.new do |spec|
   spec.version       = KadaneSan::VERSION
   spec.authors       = ["tsmsogn"]
   spec.email         = ["tsmsogn@gmail.com"]
-  spec.summary       = %q{Solving maximum subarray problem with Kadane's algorithm}
+  spec.summary       = %q{Solving maximum/minimum subarray problem with Kadane's algorithm}
   spec.description   = ""
   spec.homepage      = "https://github.com/tsmsogn/kadane_san"
   spec.license       = "MIT"

data/lib/kadane_san.rb

@@ -9,4 +9,13 @@ module KadaneSan
     end
     max_so_far
   end
+
+  def self.min_subarray(a)
+    min_so_far = min_ending_here = 1.0 / 0
+    a.each do |i|
+      min_ending_here = [i, min_ending_here + i].min
+      min_so_far = [min_so_far, min_ending_here].min
+    end
+    min_so_far
+  end
 end

data/lib/kadane_san/version.rb

@@ -1,3 +1,3 @@
 module KadaneSan
-  VERSION = "0.0.2"
+  VERSION = "0.1.0"
 end

data/spec/kadane_san_spec.rb

@@ -7,4 +7,11 @@ describe KadaneSan do
     expect(KadaneSan::max_subarray([1000, -200, 201])).to eq(1001)
     expect(KadaneSan::max_subarray([-4, -3 -2, -1])).to eq(-1)
   end
+
+  it '::min_subarray return right value' do
+    expect(KadaneSan::min_subarray([5, 1, -6, -4, -9, 6, 7])).to eq(-19)
+    expect(KadaneSan::min_subarray([-1, -2, -3, -2, 2, 1, -1, -2, -3, -2, -1, 2, -1])).to eq(-14)
+    expect(KadaneSan::min_subarray([-1000, 200, -201])).to eq(-1001)
+    expect(KadaneSan::min_subarray([4, 3, 2, 1])).to eq(1)
+  end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: kadane_san
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.1.0
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-02-25 00:00:00.000000000 Z
+date: 2015-03-11 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -91,18 +91,24 @@ required_ruby_version: !ruby/object:Gem::Requirement
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+      segments:
+      - 0
+      hash: 3845242829199364226
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+      segments:
+      - 0
+      hash: 3845242829199364226
 requirements: []
 rubyforge_project: 
 rubygems_version: 1.8.23
 signing_key: 
 specification_version: 3
-summary: Solving maximum subarray problem with Kadane's algorithm
+summary: Solving maximum/minimum subarray problem with Kadane's algorithm
 test_files:
 - spec/kadane_san_spec.rb
 - spec/spec_helper.rb