algorithm_selector 0.1.3 → 0.1.4

data/doc/Stack.html

@@ -344,15 +344,15 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-277
-278
-279
-280
-281
-282</pre>
+293
+294
+295
+296
+297
+298</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 277</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 293</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_initialize'>initialize</span><span class='lparen'>(</span><span class='id identifier rubyid_size'>size</span><span class='comma'>,</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='op'>=</span><span class='lbracket'>[</span><span class='rbracket'>]</span><span class='rparen'>)</span>
   <span class='ivar'>@size</span> <span class='op'>=</span> <span class='id identifier rubyid_size'>size</span>
@@ -409,12 +409,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-334
-335
-336</pre>
+350
+351
+352</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 334</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 350</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_empty?'>empty?</span>
   <span class='ivar'>@top</span> <span class='op'>==</span> <span class='op'>-</span><span class='int'>1</span>
@@ -461,12 +461,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-330
-331
-332</pre>
+346
+347
+348</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 330</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 346</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_full?'>full?</span>
   <span class='ivar'>@top</span> <span class='op'>==</span> <span class='lparen'>(</span><span class='ivar'>@size</span> <span class='op'>-</span> <span class='int'>1</span><span class='rparen'>)</span>
@@ -491,12 +491,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-326
-327
-328</pre>
+342
+343
+344</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 326</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 342</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_look'>look</span>
   <span class='ivar'>@store</span><span class='lbracket'>[</span><span class='ivar'>@top</span><span class='rbracket'>]</span>
@@ -521,19 +521,19 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-300
-301
-302
-303
-304
-305
-306
-307
-308
-309</pre>
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 300</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 316</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_pop'>pop</span>
   <span class='kw'>if</span> <span class='id identifier rubyid_empty?'>empty?</span>
@@ -576,18 +576,18 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-312
-313
-314
-315
-316
-317
-318
-319
-320</pre>
+328
+329
+330
+331
+332
+333
+334
+335
+336</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 312</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 328</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_push'>push</span><span class='lparen'>(</span><span class='id identifier rubyid_el'>el</span><span class='rparen'>)</span>
   <span class='kw'>if</span> <span class='id identifier rubyid_full?'>full?</span> <span class='kw'>or</span> <span class='id identifier rubyid_el'>el</span><span class='period'>.</span><span class='id identifier rubyid_nil?'>nil?</span>
@@ -630,22 +630,22 @@ Complexity: O(n)</p>
       <pre class="lines">
 
 
-286
-287
-288
-289
-290
-291
-292
-293
-294
-295
-296
-297
-298</pre>
+302
+303
+304
+305
+306
+307
+308
+309
+310
+311
+312
+313
+314</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 286</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 302</span>
 
 <span class='kw'>def</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>
   <span class='id identifier rubyid_found'>found</span> <span class='op'>=</span> <span class='kw'>false</span>
@@ -680,12 +680,12 @@ Complexity: O(n)</p>
       <pre class="lines">
 
 
-322
-323
-324</pre>
+338
+339
+340</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 322</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 338</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_size'>size</span>
   <span class='ivar'>@size</span>
@@ -700,7 +700,7 @@ Complexity: O(n)</p>
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:45:48 2016 by
+  Generated on Sat Jul 30 20:58:51 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

@@ -102,6 +102,11 @@
                 
               </li>
             
+              <li>
+                <span class='object_link'><a href="BinaryMinHeap.html" title="BinaryMinHeap (class)">BinaryMinHeap</a></span>
+                
+              </li>
+            
               <li>
                 <span class='object_link'><a href="BinaryTree.html" title="BinaryTree (class)">BinaryTree</a></span>
                 
@@ -173,7 +178,7 @@
 </div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:45:47 2016 by
+  Generated on Sat Jul 30 20:58:50 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/class_list.html

@@ -43,7 +43,7 @@
 
       <ul id="full_list" class="class">
         <li id="object_" class="odd"><div class="item" style="padding-left:30px"><span class='object_link'><a href="top-level-namespace.html" title="Top Level Namespace (root)">Top Level Namespace</a></span></div></li>
-<li id='object_AlgorithmSelector' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="AlgorithmSelector.html" title="AlgorithmSelector (module)">AlgorithmSelector</a></span><small class='search_info'>Top Level Namespace</small></div></li><li id='object_BSTNode' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="BSTNode.html" title="BSTNode (class)">BSTNode</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_BinaryTree' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="BinaryTree.html" title="BinaryTree (class)">BinaryTree</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_LinkNode' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="LinkNode.html" title="LinkNode (class)">LinkNode</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_LinkedList' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="LinkedList.html" title="LinkedList (class)">LinkedList</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Queue' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Queue.html" title="Queue (class)">Queue</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Searches' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Searches.html" title="Searches (class)">Searches</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Sorts' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Sorts.html" title="Sorts (class)">Sorts</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Stack' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Stack.html" title="Stack (class)">Stack</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li>
+<li id='object_AlgorithmSelector' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="AlgorithmSelector.html" title="AlgorithmSelector (module)">AlgorithmSelector</a></span><small class='search_info'>Top Level Namespace</small></div></li><li id='object_BSTNode' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="BSTNode.html" title="BSTNode (class)">BSTNode</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_BinaryMinHeap' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="BinaryMinHeap.html" title="BinaryMinHeap (class)">BinaryMinHeap</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_BinaryTree' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="BinaryTree.html" title="BinaryTree (class)">BinaryTree</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_LinkNode' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="LinkNode.html" title="LinkNode (class)">LinkNode</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_LinkedList' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="LinkedList.html" title="LinkedList (class)">LinkedList</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Queue' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Queue.html" title="Queue (class)">Queue</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Searches' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Searches.html" title="Searches (class)">Searches</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Sorts' class='even'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Sorts.html" title="Sorts (class)">Sorts</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li><li id='object_Stack' class='odd'><div class='item' style='padding-left:30px'><span class='object_link'><a href="Stack.html" title="Stack (class)">Stack</a></span> &lt; Object<small class='search_info'>Top Level Namespace</small></div></li>
 
       </ul>
     </div>

data/doc/file.README.html

@@ -92,6 +92,8 @@ future.</p>
 </li><li>
 <p>Quick Sort(<code>&quot;quick_sort&quot;</code>)</p>
 </li><li>
+<p>Heap Sort(<code>&quot;heap_sort&quot;</code>)</p>
+</li><li>
 <p>Searching (<code>&quot;search&quot;</code>)</p>
 </li><li>
 <p>Stack (<code>&quot;stack&quot;</code>)</p>
@@ -172,7 +174,7 @@ target)</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>
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_sort'>sort</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>
@@ -299,7 +301,7 @@ target)</code></p>
 <h2 id="label-Contributing">Contributing</h2>
 
 <p>Bug reports and pull requests are welcome on GitHub at <a
-href="https://github.com/[USERNAME]/algorithm_selector">github.com/[USERNAME]/algorithm_selector</a>.
+href="https://github.com/jnvbui/algorithm_selector">github.com/jnvbui/algorithm_selector</a>.
 This project is intended to be a safe, welcoming space for collaboration,
 and contributors are expected to adhere to the <a
 href="http://contributor-covenant.org">Contributor Covenant</a> code of
@@ -312,7 +314,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:45:47 2016 by
+  Generated on Sat Jul 30 20:58:51 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

@@ -92,6 +92,8 @@ future.</p>
 </li><li>
 <p>Quick Sort(<code>&quot;quick_sort&quot;</code>)</p>
 </li><li>
+<p>Heap Sort(<code>&quot;heap_sort&quot;</code>)</p>
+</li><li>
 <p>Searching (<code>&quot;search&quot;</code>)</p>
 </li><li>
 <p>Stack (<code>&quot;stack&quot;</code>)</p>
@@ -172,7 +174,7 @@ target)</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>
+<pre class="code ruby"><code class="ruby"><span class='const'>AlgorithmSelector</span><span class='period'>.</span><span class='id identifier rubyid_sort'>sort</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>
@@ -299,7 +301,7 @@ target)</code></p>
 <h2 id="label-Contributing">Contributing</h2>
 
 <p>Bug reports and pull requests are welcome on GitHub at <a
-href="https://github.com/[USERNAME]/algorithm_selector">github.com/[USERNAME]/algorithm_selector</a>.
+href="https://github.com/jnvbui/algorithm_selector">github.com/jnvbui/algorithm_selector</a>.
 This project is intended to be a safe, welcoming space for collaboration,
 and contributors are expected to adhere to the <a
 href="http://contributor-covenant.org">Contributor Covenant</a> code of
@@ -312,7 +314,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Sat Jul 23 23:45:47 2016 by
+  Generated on Sat Jul 30 20:58:51 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/method_list.html

@@ -62,16 +62,16 @@
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="AlgorithmSelector.html#all-instance_method" title="AlgorithmSelector#all (method)">#all</a></span>
-      <small>AlgorithmSelector</small>
+      <span class='object_link'><a href="Searches.html#all-instance_method" title="Searches#all (method)">#all</a></span>
+      <small>Searches</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="Searches.html#all-instance_method" title="Searches#all (method)">#all</a></span>
-      <small>Searches</small>
+      <span class='object_link'><a href="AlgorithmSelector.html#all-instance_method" title="AlgorithmSelector#all (method)">#all</a></span>
+      <small>AlgorithmSelector</small>
     </div>
   </li>
   
@@ -86,32 +86,32 @@
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="Searches.html#analyze-instance_method" title="Searches#analyze (method)">#analyze</a></span>
-      <small>Searches</small>
+      <span class='object_link'><a href="Sorts.html#analyze-instance_method" title="Sorts#analyze (method)">#analyze</a></span>
+      <small>Sorts</small>
     </div>
   </li>
   
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="Sorts.html#analyze-instance_method" title="Sorts#analyze (method)">#analyze</a></span>
-      <small>Sorts</small>
+      <span class='object_link'><a href="Searches.html#analyze-instance_method" title="Searches#analyze (method)">#analyze</a></span>
+      <small>Searches</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="Sorts.html#best-instance_method" title="Sorts#best (method)">#best</a></span>
-      <small>Sorts</small>
+      <span class='object_link'><a href="AlgorithmSelector.html#best-instance_method" title="AlgorithmSelector#best (method)">#best</a></span>
+      <small>AlgorithmSelector</small>
     </div>
   </li>
   
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="AlgorithmSelector.html#best-instance_method" title="AlgorithmSelector#best (method)">#best</a></span>
-      <small>AlgorithmSelector</small>
+      <span class='object_link'><a href="Sorts.html#best-instance_method" title="Sorts#best (method)">#best</a></span>
+      <small>Sorts</small>
     </div>
   </li>
   
@@ -134,13 +134,21 @@
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="Sorts.html#compare-instance_method" title="Sorts#compare (method)">#compare</a></span>
-      <small>Sorts</small>
+      <span class='object_link'><a href="BinaryMinHeap.html#child_indices-class_method" title="BinaryMinHeap.child_indices (method)">child_indices</a></span>
+      <small>BinaryMinHeap</small>
     </div>
   </li>
   
 
   <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="AlgorithmSelector.html#compare-instance_method" title="AlgorithmSelector#compare (method)">#compare</a></span>
+      <small>AlgorithmSelector</small>
+    </div>
+  </li>
+  
+
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Searches.html#compare-instance_method" title="Searches#compare (method)">#compare</a></span>
       <small>Searches</small>
@@ -148,10 +156,18 @@
   </li>
   
 
+  <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="Sorts.html#compare-instance_method" title="Sorts#compare (method)">#compare</a></span>
+      <small>Sorts</small>
+    </div>
+  </li>
+  
+
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="AlgorithmSelector.html#compare-instance_method" title="AlgorithmSelector#compare (method)">#compare</a></span>
-      <small>AlgorithmSelector</small>
+      <span class='object_link'><a href="BinaryMinHeap.html#count-instance_method" title="BinaryMinHeap#count (method)">#count</a></span>
+      <small>BinaryMinHeap</small>
     </div>
   </li>
   
@@ -197,6 +213,14 @@
   
 
   <li class="even ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryMinHeap.html#extract-instance_method" title="BinaryMinHeap#extract (method)">#extract</a></span>
+      <small>BinaryMinHeap</small>
+    </div>
+  </li>
+  
+
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="LinkedList.html#first-instance_method" title="LinkedList#first (method)">#first</a></span>
       <small>LinkedList</small>
@@ -204,7 +228,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Stack.html#full%3F-instance_method" title="Stack#full? (method)">#full?</a></span>
       <small>Stack</small>
@@ -212,7 +236,7 @@
   </li>
   
 
-  <li class="even ">
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="LinkedList.html#get-instance_method" title="LinkedList#get (method)">#get</a></span>
       <small>LinkedList</small>
@@ -220,25 +244,33 @@
   </li>
   
 
+  <li class="even ">
+    <div class="item">
+      <span class='object_link'><a href="Sorts.html#heap_sort-instance_method" title="Sorts#heap_sort (method)">#heap_sort</a></span>
+      <small>Sorts</small>
+    </div>
+  </li>
+  
+
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="LinkedList.html#include%3F-instance_method" title="LinkedList#include? (method)">#include?</a></span>
-      <small>LinkedList</small>
+      <span class='object_link'><a href="BinaryMinHeap.html#heapify_down-class_method" title="BinaryMinHeap.heapify_down (method)">heapify_down</a></span>
+      <small>BinaryMinHeap</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="BSTNode.html#initialize-instance_method" title="BSTNode#initialize (method)">#initialize</a></span>
-      <small>BSTNode</small>
+      <span class='object_link'><a href="BinaryMinHeap.html#heapify_up-class_method" title="BinaryMinHeap.heapify_up (method)">heapify_up</a></span>
+      <small>BinaryMinHeap</small>
     </div>
   </li>
   
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="LinkedList.html#initialize-instance_method" title="LinkedList#initialize (method)">#initialize</a></span>
+      <span class='object_link'><a href="LinkedList.html#include%3F-instance_method" title="LinkedList#include? (method)">#include?</a></span>
       <small>LinkedList</small>
     </div>
   </li>
@@ -246,29 +278,37 @@
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="BinaryTree.html#initialize-instance_method" title="BinaryTree#initialize (method)">#initialize</a></span>
-      <small>BinaryTree</small>
+      <span class='object_link'><a href="LinkNode.html#initialize-instance_method" title="LinkNode#initialize (method)">#initialize</a></span>
+      <small>LinkNode</small>
     </div>
   </li>
   
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="Queue.html#initialize-instance_method" title="Queue#initialize (method)">#initialize</a></span>
-      <small>Queue</small>
+      <span class='object_link'><a href="BSTNode.html#initialize-instance_method" title="BSTNode#initialize (method)">#initialize</a></span>
+      <small>BSTNode</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="LinkNode.html#initialize-instance_method" title="LinkNode#initialize (method)">#initialize</a></span>
-      <small>LinkNode</small>
+      <span class='object_link'><a href="Queue.html#initialize-instance_method" title="Queue#initialize (method)">#initialize</a></span>
+      <small>Queue</small>
     </div>
   </li>
   
 
   <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryTree.html#initialize-instance_method" title="BinaryTree#initialize (method)">#initialize</a></span>
+      <small>BinaryTree</small>
+    </div>
+  </li>
+  
+
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Stack.html#initialize-instance_method" title="Stack#initialize (method)">#initialize</a></span>
       <small>Stack</small>
@@ -276,7 +316,23 @@
   </li>
   
 
+  <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="LinkedList.html#initialize-instance_method" title="LinkedList#initialize (method)">#initialize</a></span>
+      <small>LinkedList</small>
+    </div>
+  </li>
+  
+
   <li class="even ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryMinHeap.html#initialize-instance_method" title="BinaryMinHeap#initialize (method)">#initialize</a></span>
+      <small>BinaryMinHeap</small>
+    </div>
+  </li>
+  
+
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="BinaryTree.html#insert-instance_method" title="BinaryTree#insert (method)">#insert</a></span>
       <small>BinaryTree</small>
@@ -284,7 +340,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="LinkedList.html#insert-instance_method" title="LinkedList#insert (method)">#insert</a></span>
       <small>LinkedList</small>
@@ -292,7 +348,7 @@
   </li>
   
 
-  <li class="even ">
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="BinaryTree.html#insert_to_tree-instance_method" title="BinaryTree#insert_to_tree (method)">#insert_to_tree</a></span>
       <small>BinaryTree</small>
@@ -300,7 +356,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Sorts.html#insertion_sort-instance_method" title="Sorts#insertion_sort (method)">#insertion_sort</a></span>
       <small>Sorts</small>
@@ -308,7 +364,7 @@
   </li>
   
 
-  <li class="even ">
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="LinkedList.html#last-instance_method" title="LinkedList#last (method)">#last</a></span>
       <small>LinkedList</small>
@@ -316,7 +372,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="BSTNode.html#left-instance_method" title="BSTNode#left (method)">#left</a></span>
       <small>BSTNode</small>
@@ -324,7 +380,7 @@
   </li>
   
 
-  <li class="even ">
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="Queue.html#look-instance_method" title="Queue#look (method)">#look</a></span>
       <small>Queue</small>
@@ -332,7 +388,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Stack.html#look-instance_method" title="Stack#look (method)">#look</a></span>
       <small>Stack</small>
@@ -340,7 +396,7 @@
   </li>
   
 
-  <li class="even ">
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="Sorts.html#merge_sort-instance_method" title="Sorts#merge_sort (method)">#merge_sort</a></span>
       <small>Sorts</small>
@@ -348,7 +404,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="LinkNode.html#next-instance_method" title="LinkNode#next (method)">#next</a></span>
       <small>LinkNode</small>
@@ -356,7 +412,23 @@
   </li>
   
 
+  <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryMinHeap.html#parent_index-class_method" title="BinaryMinHeap.parent_index (method)">parent_index</a></span>
+      <small>BinaryMinHeap</small>
+    </div>
+  </li>
+  
+
   <li class="even ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryMinHeap.html#peek-instance_method" title="BinaryMinHeap#peek (method)">#peek</a></span>
+      <small>BinaryMinHeap</small>
+    </div>
+  </li>
+  
+
+  <li class="odd ">
     <div class="item">
       <span class='object_link'><a href="Stack.html#pop-instance_method" title="Stack#pop (method)">#pop</a></span>
       <small>Stack</small>
@@ -364,7 +436,7 @@
   </li>
   
 
-  <li class="odd ">
+  <li class="even ">
     <div class="item">
       <span class='object_link'><a href="LinkNode.html#prev-instance_method" title="LinkNode#prev (method)">#prev</a></span>
       <small>LinkNode</small>
@@ -372,6 +444,14 @@
   </li>
   
 
+  <li class="odd ">
+    <div class="item">
+      <span class='object_link'><a href="BinaryMinHeap.html#push-instance_method" title="BinaryMinHeap#push (method)">#push</a></span>
+      <small>BinaryMinHeap</small>
+    </div>
+  </li>
+  
+
   <li class="even ">
     <div class="item">
       <span class='object_link'><a href="Stack.html#push-instance_method" title="Stack#push (method)">#push</a></span>
@@ -414,8 +494,8 @@
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="Queue.html#search-instance_method" title="Queue#search (method)">#search</a></span>
-      <small>Queue</small>
+      <span class='object_link'><a href="LinkedList.html#search-instance_method" title="LinkedList#search (method)">#search</a></span>
+      <small>LinkedList</small>
     </div>
   </li>
   
@@ -430,16 +510,16 @@
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="LinkedList.html#search-instance_method" title="LinkedList#search (method)">#search</a></span>
-      <small>LinkedList</small>
+      <span class='object_link'><a href="BinaryTree.html#search-instance_method" title="BinaryTree#search (method)">#search</a></span>
+      <small>BinaryTree</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="BinaryTree.html#search-instance_method" title="BinaryTree#search (method)">#search</a></span>
-      <small>BinaryTree</small>
+      <span class='object_link'><a href="Queue.html#search-instance_method" title="Queue#search (method)">#search</a></span>
+      <small>Queue</small>
     </div>
   </li>
   
@@ -462,16 +542,16 @@
 
   <li class="odd ">
     <div class="item">
-      <span class='object_link'><a href="Queue.html#size-instance_method" title="Queue#size (method)">#size</a></span>
-      <small>Queue</small>
+      <span class='object_link'><a href="Stack.html#size-instance_method" title="Stack#size (method)">#size</a></span>
+      <small>Stack</small>
     </div>
   </li>
   
 
   <li class="even ">
     <div class="item">
-      <span class='object_link'><a href="Stack.html#size-instance_method" title="Stack#size (method)">#size</a></span>
-      <small>Stack</small>
+      <span class='object_link'><a href="Queue.html#size-instance_method" title="Queue#size (method)">#size</a></span>
+      <small>Queue</small>
     </div>
   </li>