algorithm_selector 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c92f24acb4d6a2fafd53e85e8175d4df16852bad
-  data.tar.gz: ecb1b1b2af1a69e09694f0203d47902a58e16bba
+  metadata.gz: a376e6c105667d3e1f30aa00c689d6caa209567f
+  data.tar.gz: db8a9e8f776ea09157acd5f5b8159ae0c22db606
 SHA512:
-  metadata.gz: 36a078f0b02d232a1ee251ae9e55c94448f503f6fc2d5bcd72b042cbc3eab1db91d585fcfdaf96e0b312ca1071f579e2bc7d9a15c3ebd445ee92ada0cf2f8fab
-  data.tar.gz: 2fe851dd30394dc7f9bff8e7c5b78b14ef9afb25931aa0500c0cd66d63cdde907ee21b68efa4152c04049bb065c4bd8f3c58b57ab9358d7c1dc31cbe7cc10cbb
+  metadata.gz: 5a82bc793441968d2c9e09d6e2b4ac39c5df87dc08a4d84aa067fb06561f33fa9500bce58992c1acc3b32032f0b1d984a51adee0b61fa523947fb3074972fb56
+  data.tar.gz: aa3f80b8936fc8e2eeb0a00a0bf0b4c4567b74d14ac1db937839b6deb4aa5ffb50a4cbeed16a2e4d1d446b15c4aa39fa557114fad7936e83bb2c6250eaed328c

data/.gitignore

@@ -1,2 +1,3 @@
 algorithm_selector-0.1.0.gem
 algorithm_selector-0.1.1.gem
+algorithm_selector-0.1.2.gem

data/.yardoc/checksums

@@ -1,2 +1,2 @@
 lib/algorithm_selector.rb 300cdf69ec09250719da398de917f15df18d8761
-lib/algorithm_selector/version.rb 87587aa036583321d3bbdda4db673036572e46a9
+lib/algorithm_selector/version.rb 7003767023eb9510f1fdeffc9ebaec0b15cbb3a9

data/README.md

@@ -36,13 +36,16 @@ Written by Joseph Bui.
 * `all(action, data_set, trials, target)`
   * Returns the times for each algorithm
   * Example:
+
 ```ruby
 AlgorithmSelector.all("sort", [2,1,4,3], 1000)
 AlgorithmSelector.all("search", [2,1,4,3], 1000, 4)
 ```
+
 * `best(action, data_set, trials, target)`
   * Returns the algorithm with the best time
   * Example:
+
 ```ruby
 AlgorithmSelector.best("sort", [2,1,4,3], 1000)
 AlgorithmSelector.best("search", [2,1,4,3], 1000, 4)
@@ -51,6 +54,7 @@ AlgorithmSelector.best("search", [2,1,4,3], 1000, 4)
 * `analyze(action, data_set, algorithm, trials, target)`
   * Returns time for specified algorithm or data structure
   * Example:
+
 ```ruby
 AlgorithmSelector.analyze("sort", [2,1,4,3], "merge_sort", 1000)
 AlgorithmSelector.analyze("search", [2,1,4,3], "linked_list", 1000, 4)
@@ -59,6 +63,7 @@ AlgorithmSelector.analyze("search", [2,1,4,3], "linked_list", 1000, 4)
 * `compare(action, data_set, first_algorithm, second_algorithm, trials, target)`
   * Returns the times of two specified algorithms for comparison
   * Example:
+
 ```ruby
 AlgorithmSelector.compare("sort", [2,1,4,3], "merge_sort", "quick_sort", 1000)
 AlgorithmSelector.compare("search", [2,1,4,3], "stack", "linked_list", 1000, 4)
@@ -67,6 +72,7 @@ AlgorithmSelector.compare("search", [2,1,4,3], "stack", "linked_list", 1000, 4)
 * `sort(data_set, algorithm)`
   * Returns sorted array of specified sorting algorithm
   * Example:
+
 ```ruby
 AlgorithmSelector.compare([2,1,4,3], "bubble_sort")
 ```
@@ -74,78 +80,102 @@ AlgorithmSelector.compare([2,1,4,3], "bubble_sort")
 ### Data Structures
 
 #### Stack
-  * Initialize
-  ```ruby
-  size = 10
-  stack = Stack.new(size)
-  ```
-  * Insertion
-  ```ruby
-  # returns nil
-  value = 6
-  stack.push(value)
-  ```
-  * Search
-  ```ruby
-  # returns true if found, else returns false
-  target = 4
-  stack.search(target)
-  ```
+
+* Initialize
+
+```ruby
+size = 10
+stack = Stack.new(size)
+```
+
+* Insertion
+
+```ruby
+# returns nil
+value = 6
+stack.push(value)
+```
+
+* Search
+
+```ruby
+# returns true if found, else returns false
+target = 4
+stack.search(target)
+```
 
 #### Queue
-  * Initialize
-  ```ruby
-  size = 10
-  queue = Queue.new(size)
-  ```
-  * Insertion
-  ```ruby
-  # returns nil
-  value = 6
-  queue.enqueue(value)
-  ```
-  * Search
-  ```ruby
-  # returns true if found, else returns false
-  target = 4
-  queue.search(target)
-  ```
+
+* Initialize
+
+```ruby
+size = 10
+queue = Queue.new(size)
+```
+
+* Insertion
+
+```ruby
+# returns nil
+value = 6
+queue.enqueue(value)
+```
+
+* Search
+
+```ruby
+# returns true if found, else returns false
+target = 4
+queue.search(target)
+```
 
 #### Linked List
-  * Initialize
-  ```ruby
-  linked_list = LinkedList.new
-  ```
-  * Insertion
-  ```ruby
-  # returns nil
-  value = 6
-  linked_list.insert(value)
-  ```
-  * Search
-  ```ruby
-  # returns true if found, else returns false
-  target = 4
-  linked_list.search(target)
-  ```
+
+* Initialize
+
+```ruby
+linked_list = LinkedList.new
+```
+
+* Insertion
+
+```ruby
+# returns nil
+value = 6
+linked_list.insert(value)
+```
+
+* Search
+
+```ruby
+# returns true if found, else returns false
+target = 4
+linked_list.search(target)
+```
 
 #### Binary Search Tree
-  * Initialize
-  ```ruby
-  binary_tree = BinaryTree.new
-  ```
-  * Insertion
-  ```ruby
-  # returns nil
-  value = 6
-  binary_tree.insert(value)
-  ```
-  * Search
-  ```ruby
-  # returns true if found, else returns false
-  target = 4
-  binary_tree.search(target)
-  ```
+
+* Initialize
+
+```ruby
+binary_tree = BinaryTree.new
+```
+
+* Insertion
+
+```ruby
+# returns nil
+value = 6
+binary_tree.insert(value)
+```
+
+* Search
+
+```ruby
+# returns true if found, else returns false
+target = 4
+binary_tree.search(target)
+```
 
 ## Installation
 

data/doc/AlgorithmSelector.html

@@ -115,7 +115,7 @@
       <dt id="VERSION-constant" class="">VERSION =
         
       </dt>
-      <dd><pre class="code"><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>0.1.1</span><span class='tstring_end'>&quot;</span></span></pre></dd>
+      <dd><pre class="code"><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>0.1.2</span><span class='tstring_end'>&quot;</span></span></pre></dd>
     
   </dl>
 
@@ -506,7 +506,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:47 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/BSTNode.html

@@ -430,7 +430,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:28 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/BinaryTree.html

@@ -562,7 +562,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/LinkNode.html

@@ -430,7 +430,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/LinkedList.html

@@ -869,7 +869,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/Queue.html

@@ -546,7 +546,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/Searches.html

@@ -495,7 +495,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/Sorts.html

@@ -907,7 +907,7 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/Stack.html

@@ -700,7 +700,7 @@ Complexity: O(n)</p>
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:48 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/_index.html

@@ -173,7 +173,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:47 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/file.README.html

@@ -124,89 +124,157 @@ future.</p>
 </li><li>
 <p>Returns the times for each algorithm</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.all(&quot;sort&quot;, [2,1,4,3],
-1000) AlgorithmSelector.all(&quot;search&quot;, [2,1,4,3], 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>best(action, data_set, trials, target)</code></p>
 </li><li>
 <p>Returns the algorithm with the best time</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.best(&quot;sort&quot;, [2,1,4,3],
-1000) AlgorithmSelector.best(&quot;search&quot;, [2,1,4,3], 1000, 4)
-</code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>analyze(action, data_set, algorithm, trials, target)</code></p>
 </li><li>
 <p>Returns time for specified algorithm or data structure</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.analyze(&quot;sort&quot;, [2,1,4,3],
-&quot;merge_sort&quot;, 1000) AlgorithmSelector.analyze(&quot;search&quot;,
-[2,1,4,3], &quot;linked_list&quot;, 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>compare(action, data_set, first_algorithm, second_algorithm, trials,
 target)</code></p>
 </li><li>
 <p>Returns the times of two specified algorithms for comparison</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.compare(&quot;sort&quot;, [2,1,4,3],
-&quot;merge_sort&quot;, &quot;quick_sort&quot;, 1000)
-AlgorithmSelector.compare(&quot;search&quot;, [2,1,4,3], &quot;stack&quot;,
-&quot;linked_list&quot;, 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>quick_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>stack</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>sort(data_set, algorithm)</code></p>
 </li><li>
 <p>Returns sorted array of specified sorting algorithm</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.compare([2,1,4,3],
-&quot;bubble_sort&quot;) </code></p>
+<p>Example:</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>bubble_sort</span><span class='tstring_end'>&quot;</span></span><span class='rparen'>)</span>
+</code></pre>
+
 <h3 id="label-Data+Structures">Data Structures</h3>
 
 <h4 id="label-Stack">Stack</h4>
 <ul><li>
-<p>Initialize  <code>ruby   size = 10   stack = Stack.new(size) </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6   stack.push(value)
-</code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   stack.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
+<span class='id identifier rubyid_stack'>stack</span> <span class='op'>=</span> <span class='const'>Stack</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_push'>push</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Queue">Queue</h4>
 <ul><li>
-<p>Initialize  <code>ruby   size = 10   queue = Queue.new(size) </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6   queue.enqueue(value)
-</code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   queue.search(target) </code></p>
+<p>Initialize</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
+<span class='id identifier rubyid_queue'>queue</span> <span class='op'>=</span> <span class='const'>Queue</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_enqueue'>enqueue</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Linked+List">Linked List</h4>
 <ul><li>
-<p>Initialize  <code>ruby   linked_list = LinkedList.new </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6  
-linked_list.insert(value) </code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   linked_list.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_linked_list'>linked_list</span> <span class='op'>=</span> <span class='const'>LinkedList</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Binary+Search+Tree">Binary Search Tree</h4>
 <ul><li>
-<p>Initialize  <code>ruby   binary_tree = BinaryTree.new </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6  
-binary_tree.insert(value) </code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   binary_tree.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_binary_tree'>binary_tree</span> <span class='op'>=</span> <span class='const'>BinaryTree</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h2 id="label-Installation">Installation</h2>
 
 <p>Add this line to your application&#39;s Gemfile:</p>
@@ -244,7 +312,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:47 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/index.html

@@ -124,89 +124,157 @@ future.</p>
 </li><li>
 <p>Returns the times for each algorithm</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.all(&quot;sort&quot;, [2,1,4,3],
-1000) AlgorithmSelector.all(&quot;search&quot;, [2,1,4,3], 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>best(action, data_set, trials, target)</code></p>
 </li><li>
 <p>Returns the algorithm with the best time</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.best(&quot;sort&quot;, [2,1,4,3],
-1000) AlgorithmSelector.best(&quot;search&quot;, [2,1,4,3], 1000, 4)
-</code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>analyze(action, data_set, algorithm, trials, target)</code></p>
 </li><li>
 <p>Returns time for specified algorithm or data structure</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.analyze(&quot;sort&quot;, [2,1,4,3],
-&quot;merge_sort&quot;, 1000) AlgorithmSelector.analyze(&quot;search&quot;,
-[2,1,4,3], &quot;linked_list&quot;, 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>compare(action, data_set, first_algorithm, second_algorithm, trials,
 target)</code></p>
 </li><li>
 <p>Returns the times of two specified algorithms for comparison</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.compare(&quot;sort&quot;, [2,1,4,3],
-&quot;merge_sort&quot;, &quot;quick_sort&quot;, 1000)
-AlgorithmSelector.compare(&quot;search&quot;, [2,1,4,3], &quot;stack&quot;,
-&quot;linked_list&quot;, 1000, 4) </code></p>
-</li><li>
+<p>Example:</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>merge_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>quick_sort</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='rparen'>)</span>
+<span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>search</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>stack</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>linked_list</span><span class='tstring_end'>&quot;</span></span><span class='comma'>,</span> <span class='int'>1000</span><span class='comma'>,</span> <span class='int'>4</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
 <p><code>sort(data_set, algorithm)</code></p>
 </li><li>
 <p>Returns sorted array of specified sorting algorithm</p>
 </li><li>
-<p>Example: <code>ruby AlgorithmSelector.compare([2,1,4,3],
-&quot;bubble_sort&quot;) </code></p>
+<p>Example:</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='lbracket'>[</span><span class='int'>2</span><span class='comma'>,</span><span class='int'>1</span><span class='comma'>,</span><span class='int'>4</span><span class='comma'>,</span><span class='int'>3</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='tstring'><span class='tstring_beg'>&quot;</span><span class='tstring_content'>bubble_sort</span><span class='tstring_end'>&quot;</span></span><span class='rparen'>)</span>
+</code></pre>
+
 <h3 id="label-Data+Structures">Data Structures</h3>
 
 <h4 id="label-Stack">Stack</h4>
 <ul><li>
-<p>Initialize  <code>ruby   size = 10   stack = Stack.new(size) </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6   stack.push(value)
-</code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   stack.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
+<span class='id identifier rubyid_stack'>stack</span> <span class='op'>=</span> <span class='const'>Stack</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_push'>push</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_stack'>stack</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Queue">Queue</h4>
 <ul><li>
-<p>Initialize  <code>ruby   size = 10   queue = Queue.new(size) </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6   queue.enqueue(value)
-</code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   queue.search(target) </code></p>
+<p>Initialize</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_size'>size</span> <span class='op'>=</span> <span class='int'>10</span>
+<span class='id identifier rubyid_queue'>queue</span> <span class='op'>=</span> <span class='const'>Queue</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_enqueue'>enqueue</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_queue'>queue</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Linked+List">Linked List</h4>
 <ul><li>
-<p>Initialize  <code>ruby   linked_list = LinkedList.new </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6  
-linked_list.insert(value) </code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   linked_list.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_linked_list'>linked_list</span> <span class='op'>=</span> <span class='const'>LinkedList</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_linked_list'>linked_list</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h4 id="label-Binary+Search+Tree">Binary Search Tree</h4>
 <ul><li>
-<p>Initialize  <code>ruby   binary_tree = BinaryTree.new </code></p>
-</li><li>
-<p>Insertion  <code>ruby   # returns nil   value = 6  
-binary_tree.insert(value) </code></p>
-</li><li>
-<p>Search  <code>ruby   # returns true if found, else returns false   target =
-4   binary_tree.search(target) </code></p>
+<p>Initialize</p>
 </li></ul>
 
+<pre class="code ruby"><code class="ruby"><span class='id identifier rubyid_binary_tree'>binary_tree</span> <span class='op'>=</span> <span class='const'>BinaryTree</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span>
+</code></pre>
+<ul><li>
+<p>Insertion</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns nil
+</span><span class='id identifier rubyid_value'>value</span> <span class='op'>=</span> <span class='int'>6</span>
+<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_insert'>insert</span><span class='lparen'>(</span><span class='id identifier rubyid_value'>value</span><span class='rparen'>)</span>
+</code></pre>
+<ul><li>
+<p>Search</p>
+</li></ul>
+
+<pre class="code ruby"><code class="ruby"><span class='comment'># returns true if found, else returns false
+</span><span class='id identifier rubyid_target'>target</span> <span class='op'>=</span> <span class='int'>4</span>
+<span class='id identifier rubyid_binary_tree'>binary_tree</span><span class='period'>.</span><span class='id identifier rubyid_search'>search</span><span class='lparen'>(</span><span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
+</code></pre>
+
 <h2 id="label-Installation">Installation</h2>
 
 <p>Add this line to your application&#39;s Gemfile:</p>
@@ -244,7 +312,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:47 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/doc/top-level-namespace.html

@@ -104,7 +104,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:26:27 2016 by
+  Generated on Sat Jul 23 23:45:47 2016 by
   <a href="http://yardoc.org" title="Yay! A Ruby Documentation Tool" target="_parent">yard</a>
   0.9.4 (ruby-2.1.2).
 </div>

data/lib/algorithm_selector/version.rb

@@ -1,3 +1,3 @@
 module AlgorithmSelector
-  VERSION = "0.1.2"
+  VERSION = "0.1.3"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: algorithm_selector
 version: !ruby/object:Gem::Version
-  version: 0.1.2
+  version: 0.1.3
 platform: ruby
 authors:
 - joseph