algorithm_selector 0.1.3 → 0.1.4

data/doc/Queue.html

@@ -299,17 +299,17 @@
       <pre class="lines">
 
 
-342
-343
-344
-345
-346
-347
-348
-349</pre>
+358
+359
+360
+361
+362
+363
+364
+365</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 342</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 358</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>
@@ -346,20 +346,20 @@
       <pre class="lines">
 
 
-361
-362
-363
-364
-365
-366
-367
-368
-369
-370
-371</pre>
+377
+378
+379
+380
+381
+382
+383
+384
+385
+386
+387</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 361</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 377</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_dequeue'>dequeue</span>
   <span class='kw'>if</span> <span class='id identifier rubyid_empty?'>empty?</span>
@@ -403,18 +403,18 @@
       <pre class="lines">
 
 
-374
-375
-376
-377
-378
-379
-380
-381
-382</pre>
+390
+391
+392
+393
+394
+395
+396
+397
+398</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 374</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 390</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_enqueue'>enqueue</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>
@@ -445,12 +445,12 @@
       <pre class="lines">
 
 
-388
-389
-390</pre>
+404
+405
+406</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 388</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 404</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'>@head</span><span class='rbracket'>]</span>
@@ -486,17 +486,17 @@
       <pre class="lines">
 
 
-352
-353
-354
-355
-356
-357
-358
-359</pre>
+368
+369
+370
+371
+372
+373
+374
+375</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 352</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 368</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>
@@ -526,12 +526,12 @@
       <pre class="lines">
 
 
-384
-385
-386</pre>
+400
+401
+402</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 384</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 400</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_size'>size</span>
   <span class='ivar'>@size</span>
@@ -546,7 +546,7 @@
 </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/Searches.html

@@ -258,25 +258,25 @@
       <pre class="lines">
 
 
-207
-208
-209
-210
-211
-212
-213
-214
-215
-216
-217
-218
-219
-220
-221
-222</pre>
+223
+224
+225
+226
+227
+228
+229
+230
+231
+232
+233
+234
+235
+236
+237
+238</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 207</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 223</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</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_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span><span class='comma'>,</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
@@ -325,22 +325,22 @@
       <pre class="lines">
 
 
-241
-242
-243
-244
-245
-246
-247
-248
-249
-250
-251
-252
-253</pre>
+257
+258
+259
+260
+261
+262
+263
+264
+265
+266
+267
+268
+269</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 241</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 257</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_algorithm'>algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
@@ -386,23 +386,23 @@
       <pre class="lines">
 
 
-225
-226
-227
-228
-229
-230
-231
-232
-233
-234
-235
-236
-237
-238</pre>
+241
+242
+243
+244
+245
+246
+247
+248
+249
+250
+251
+252
+253
+254</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 225</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 241</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
@@ -449,25 +449,25 @@
       <pre class="lines">
 
 
-256
-257
-258
-259
-260
-261
-262
-263
-264
-265
-266
-267
-268
-269
-270
-271</pre>
+272
+273
+274
+275
+276
+277
+278
+279
+280
+281
+282
+283
+284
+285
+286
+287</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 256</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 272</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_first_algorithm'>first_algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_second_algorithm'>second_algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='comma'>,</span> <span class='id identifier rubyid_target'>target</span><span class='rparen'>)</span>
@@ -495,7 +495,7 @@
 </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/Sorts.html

@@ -246,6 +246,31 @@ O(n^2) Worst-Case Time Complexity: O(n^2).</p>
 <p>Show comparison of two algorithms.</p>
 </div></span>
   
+</li>
+
+      
+        <li class="public ">
+  <span class="summary_signature">
+    
+      <a href="#heap_sort-instance_method" title="#heap_sort (instance method)">#<strong>heap_sort</strong>(data_set)  &#x21d2; Object </a>
+    
+
+    
+  </span>
+  
+  
+  
+  
+  
+  
+  
+
+  
+    <span class="summary_desc"><div class='inline'>
+<p>Quick sort Worst-Case Space Complexity: O(1) Averge-Case Time Complexity:
+O(n log(n)) Worst-Case Time Complexity: O(n log(n)).</p>
+</div></span>
+  
 </li>
 
       
@@ -395,7 +420,8 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
 65
 66
 67
-68</pre>
+68
+69</pre>
     </td>
     <td>
       <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 57</span>
@@ -408,7 +434,8 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
       <span class='label'>insertion_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_insertion_sort'>insertion_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span><span class='comma'>,</span>
       <span class='label'>selection_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_selection_sort'>selection_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span><span class='comma'>,</span>
       <span class='label'>merge_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_merge_sort'>merge_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span><span class='comma'>,</span>
-      <span class='label'>quick_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_quick_sort'>quick_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
+      <span class='label'>quick_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_quick_sort'>quick_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span><span class='comma'>,</span>
+      <span class='label'>heap_sort:</span> <span class='id identifier rubyid_display_time'>display_time</span><span class='lparen'>(</span><span class='const'>Proc</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span> <span class='lbrace'>{</span><span class='id identifier rubyid_heap_sort'>heap_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span><span class='rbrace'>}</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
     <span class='rbrace'>}</span>
   <span class='rbrace'>}</span>
 <span class='kw'>end</span></pre>
@@ -443,7 +470,6 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
       <pre class="lines">
 
 
-87
 88
 89
 90
@@ -455,10 +481,11 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
 96
 97
 98
-99</pre>
+99
+100</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 87</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 88</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_analyze'>analyze</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_algorithm'>algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
@@ -504,7 +531,6 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
       <pre class="lines">
 
 
-71
 72
 73
 74
@@ -517,10 +543,11 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2).</p>
 81
 82
 83
-84</pre>
+84
+85</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 71</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 72</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_best'>best</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
@@ -568,7 +595,6 @@ O(n^2) Worst-Case Time Complexity: O(n^2)</p>
       <pre class="lines">
 
 
-123
 124
 125
 126
@@ -583,10 +609,11 @@ O(n^2) Worst-Case Time Complexity: O(n^2)</p>
 135
 136
 137
-138</pre>
+138
+139</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 123</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 124</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_bubble_sort'>bubble_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
   <span class='kw'>return</span> <span class='id identifier rubyid_data_set'>data_set</span> <span class='kw'>if</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span> <span class='op'>&lt;</span> <span class='int'>2</span>
@@ -635,7 +662,6 @@ O(n^2) Worst-Case Time Complexity: O(n^2)</p>
       <pre class="lines">
 
 
-102
 103
 104
 105
@@ -650,10 +676,11 @@ O(n^2) Worst-Case Time Complexity: O(n^2)</p>
 114
 115
 116
-117</pre>
+117
+118</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 102</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 103</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_compare'>compare</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_first_algorithm'>first_algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_second_algorithm'>second_algorithm</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
   <span class='id identifier rubyid_hash'>hash</span> <span class='op'>=</span> <span class='id identifier rubyid_all'>all</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_trials'>trials</span><span class='rparen'>)</span>
@@ -674,6 +701,62 @@ O(n^2) Worst-Case Time Complexity: O(n^2)</p>
     </td>
   </tr>
 </table>
+</div>
+    
+      <div class="method_details ">
+  <h3 class="signature " id="heap_sort-instance_method">
+  
+    #<strong>heap_sort</strong>(data_set)  &#x21d2; <tt>Object</tt> 
+  
+
+  
+
+  
+</h3><div class="docstring">
+  <div class="discussion">
+    
+<p>Quick sort Worst-Case Space Complexity: O(1) Averge-Case Time Complexity:
+O(n log(n)) Worst-Case Time Complexity: O(n log(n))</p>
+
+
+  </div>
+</div>
+<div class="tags">
+  
+
+</div><table class="source_code">
+  <tr>
+    <td>
+      <pre class="lines">
+
+
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215</pre>
+    </td>
+    <td>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 206</span>
+
+<span class='kw'>def</span> <span class='id identifier rubyid_heap_sort'>heap_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
+  <span class='lparen'>(</span><span class='int'>2</span><span class='op'>..</span><span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span><span class='rparen'>)</span><span class='period'>.</span><span class='id identifier rubyid_to_a'>to_a</span><span class='period'>.</span><span class='id identifier rubyid_each'>each</span> <span class='kw'>do</span> <span class='op'>|</span><span class='id identifier rubyid_idx'>idx</span><span class='op'>|</span>
+    <span class='const'>BinaryMinHeap</span><span class='period'>.</span><span class='id identifier rubyid_heapify_up'>heapify_up</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='id identifier rubyid_idx'>idx</span> <span class='op'>-</span> <span class='int'>1</span><span class='comma'>,</span> <span class='id identifier rubyid_idx'>idx</span><span class='rparen'>)</span>
+  <span class='kw'>end</span>
+  <span class='lparen'>(</span><span class='int'>2</span><span class='op'>..</span><span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span><span class='rparen'>)</span><span class='period'>.</span><span class='id identifier rubyid_to_a'>to_a</span><span class='period'>.</span><span class='id identifier rubyid_reverse'>reverse</span><span class='period'>.</span><span class='id identifier rubyid_each'>each</span> <span class='kw'>do</span> <span class='op'>|</span><span class='id identifier rubyid_idx'>idx</span><span class='op'>|</span>
+    <span class='id identifier rubyid_data_set'>data_set</span><span class='lbracket'>[</span><span class='id identifier rubyid_idx'>idx</span> <span class='op'>-</span> <span class='int'>1</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='lbracket'>[</span><span class='int'>0</span><span class='rbracket'>]</span> <span class='op'>=</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='lbracket'>[</span><span class='int'>0</span><span class='rbracket'>]</span><span class='comma'>,</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='lbracket'>[</span><span class='id identifier rubyid_idx'>idx</span> <span class='op'>-</span> <span class='int'>1</span><span class='rbracket'>]</span>
+    <span class='const'>BinaryMinHeap</span><span class='period'>.</span><span class='id identifier rubyid_heapify_down'>heapify_down</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='comma'>,</span> <span class='int'>0</span><span class='comma'>,</span> <span class='id identifier rubyid_idx'>idx</span> <span class='op'>-</span> <span class='int'>1</span><span class='rparen'>)</span>
+  <span class='kw'>end</span>
+  <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_reverse!'>reverse!</span>
+<span class='kw'>end</span></pre>
+    </td>
+  </tr>
+</table>
 </div>
     
       <div class="method_details ">
@@ -703,7 +786,6 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
       <pre class="lines">
 
 
-144
 145
 146
 147
@@ -715,10 +797,11 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
 153
 154
 155
-156</pre>
+156
+157</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 144</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 145</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_insertion_sort'>insertion_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
   <span class='kw'>return</span> <span class='id identifier rubyid_data_set'>data_set</span> <span class='kw'>if</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span> <span class='op'>&lt;</span> <span class='int'>2</span>
@@ -765,16 +848,16 @@ O(n log(n)) Worst-Case Time Complexity: O(n log(n))</p>
       <pre class="lines">
 
 
-181
 182
 183
 184
 185
 186
-187</pre>
+187
+188</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 181</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 182</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_merge_sort'>merge_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
   <span class='kw'>return</span> <span class='id identifier rubyid_data_set'>data_set</span> <span class='kw'>if</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span> <span class='op'>&lt;</span> <span class='int'>2</span>
@@ -815,16 +898,16 @@ Complexity: O(n log(n)) Worst-Case Time Complexity: O(n^2)</p>
       <pre class="lines">
 
 
-193
 194
 195
 196
 197
 198
-199</pre>
+199
+200</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 193</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 194</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_quick_sort'>quick_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
   <span class='kw'>return</span> <span class='id identifier rubyid_data_set'>data_set</span> <span class='kw'>if</span> <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_count'>count</span> <span class='op'>&lt;</span> <span class='int'>2</span>
@@ -865,7 +948,6 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
       <pre class="lines">
 
 
-162
 163
 164
 165
@@ -878,10 +960,11 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</p>
 172
 173
 174
-175</pre>
+175
+176</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 162</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 163</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_selection_sort'>selection_sort</span><span class='lparen'>(</span><span class='id identifier rubyid_data_set'>data_set</span><span class='rparen'>)</span>
   <span class='lparen'>(</span><span class='int'>0</span><span class='op'>...</span><span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_length'>length</span><span class='op'>-</span><span class='int'>1</span><span class='rparen'>)</span><span class='period'>.</span><span class='id identifier rubyid_to_a'>to_a</span><span class='period'>.</span><span class='id identifier rubyid_each'>each</span> <span class='kw'>do</span> <span class='op'>|</span><span class='id identifier rubyid_i'>i</span><span class='op'>|</span>
@@ -907,7 +990,7 @@ Complexity: O(n^2) Worst-Case Time Complexity: O(n^2)</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>