algorithm_selector 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 032b14485d824a2c4dd81927fb396ec2e8459eb8
-  data.tar.gz: 978f5e84e437c271fdfa1c01ea9db81ba925cbb7
+  metadata.gz: a981d20084dca80e4760e858f1233ff4f3a0e394
+  data.tar.gz: 61a39abe1b79911178a190d82a246d81cdbf599e
 SHA512:
-  metadata.gz: edc6f796d8d1021a322c959cc500d0f807a50b894dd446f54b34f14c3a32fafe407a7f65b754be7a5420e31f8f43d274b9aa061a76aa1ed1c9322cb564640b04
-  data.tar.gz: 0b600354d700711fc4095f056685f22d13e369bc3b0cbbde4622be6d920afada8451830332bbefa9d00ea7e7449a23226bcdda38d0872e59667b38c7fd854020
+  metadata.gz: d599d67a51d13dd4e21719b08961b3432792bcabc2fbaf54955378ca1709f85f6b016792c825c6f8eaa68d1439506acfe51bcefda55b5ce7f68a0652c5717e97
+  data.tar.gz: bb215af0fa14d30204743baf7e8ac6fdb426f568c397f09a41b6e7b089d3e62ef7dd24f96581d29e6e92c4e542f5ab87a14cbacac07512748425d37d067a8db9

data/README.md

@@ -1,5 +1,10 @@
 # AlgorithmSelector
 
+## Description
+
+Gem for analyzing and using the best data structures or algorithms for your particular
+data set. Written by Joseph Bui.
+
 ## Installation
 
 Add this line to your application's Gemfile:
@@ -22,18 +27,37 @@ Require the Gem:
 
     $ require 'algorithm_selector'
 
-### Saying hello
-
-You can create a string "hello" by using the test method. For example:
-
-  AlgorithmSelector.test([1])
-  #=> "hello"
+### Features
 
-## Development
-
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+* See all times of algorithms for data set
+```ruby
+# For Sorting algorithms
+all(type, array, number_of_trials)
+
+# example
+# => {:sorted=>[1, 2, 3, 4, 5],
+#     :results=>
+#       {:bubble_sort=>1.329500000000018e-06,
+#        :insertion_sort=>1.3745000000000046e-06,
+#        :selection_sort=>5.778000000000015e-06,
+#        :merge_sort=>6.3820000000000526e-06,
+#        :quick_sort=>5.709000000000024e-06}}
+
+####################################
+
+# For Searching algorithms
+all(type, array, number_of_trials, target)
+
+# example
+# all("search", [5,4,3,2,1], 2000, 3)
+# => {:found=>true,
+#     :results=>
+#       {:stack=>6.156000000000004e-06,
+#        :queue=>5.315499999999899e-06,
+#        :linked_list=>1.050999999999992e-06,
+#        :binary_tree=>8.534999999999816e-07}}
 
-To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+```
 
 ## Contributing
 

data/algorithm_selector.gemspec

@@ -10,9 +10,8 @@ Gem::Specification.new do |spec|
   spec.email         = ["jnvbui@gmail.com"]
 
   spec.summary       = %q{Takes a desired action and data set, returns best algorithm.}
-  spec.description   = %q{A gem for determing the most efficient algorithm to use for a particular data set.
-                          Currently supports Sorting, Searching, Inserting and Deleting algorithms.
-                          Will add Graph Algorithms in the future}
+  spec.description   = %q{A gem for determing the most efficient algorithm or data structure to use for a particular data set.
+                          Currently supports the following data structures and algorithms: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Stack, Queue, Linked List, Binary Search Tree}
   spec.homepage      = "https://github.com/jnvbui/algorithm_selector"
   spec.license       = "MIT"
 

data/lib/algorithm_selector/version.rb

@@ -1,3 +1,3 @@
 module AlgorithmSelector
-  VERSION = "0.1.0"
+  VERSION = "0.1.1"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: algorithm_selector
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - joseph
@@ -53,9 +53,8 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '3.0'
 description: |-
-  A gem for determing the most efficient algorithm to use for a particular data set.
-                            Currently supports Sorting, Searching, Inserting and Deleting algorithms.
-                            Will add Graph Algorithms in the future
+  A gem for determing the most efficient algorithm or data structure to use for a particular data set.
+                            Currently supports the following data structures and algorithms: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Stack, Queue, Linked List, Binary Search Tree
 email:
 - jnvbui@gmail.com
 executables: []