algorithm_selector 0.1.1 → 0.1.2

data/doc/Stack.html

@@ -174,7 +174,7 @@
         <li class="public ">
   <span class="summary_signature">
     
-      <a href="#initialize-instance_method" title="#initialize (instance method)">#<strong>initialize</strong>(size, array = [])  &#x21d2; Stack </a>
+      <a href="#initialize-instance_method" title="#initialize (instance method)">#<strong>initialize</strong>(size, data_set = [])  &#x21d2; Stack </a>
     
 
     
@@ -236,9 +236,7 @@
   
 
   
-    <span class="summary_desc"><div class='inline'>
-<p>Deletion, Worst-Case Time Complexity: O(1).</p>
-</div></span>
+    <span class="summary_desc"><div class='inline'></div></span>
   
 </li>
 
@@ -323,7 +321,7 @@ Complexity: O(n).</p>
     <div class="method_details first">
   <h3 class="signature first" id="initialize-instance_method">
   
-    #<strong>initialize</strong>(size, array = [])  &#x21d2; <tt><span class='object_link'><a href="" title="Stack (class)">Stack</a></span></tt> 
+    #<strong>initialize</strong>(size, data_set = [])  &#x21d2; <tt><span class='object_link'><a href="" title="Stack (class)">Stack</a></span></tt> 
   
 
   
@@ -346,21 +344,21 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-266
-267
-268
-269
-270
-271</pre>
+277
+278
+279
+280
+281
+282</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 266</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 277</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_array'>array</span><span class='op'>=</span><span class='lbracket'>[</span><span class='rbracket'>]</span><span class='rparen'>)</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>
   <span class='ivar'>@store</span> <span class='op'>=</span> <span class='const'>Array</span><span class='period'>.</span><span class='id identifier rubyid_new'>new</span><span class='lparen'>(</span><span class='ivar'>@size</span><span class='rparen'>)</span>
   <span class='ivar'>@top</span> <span class='op'>=</span> <span class='op'>-</span><span class='int'>1</span>
-  <span class='id identifier rubyid_array'>array</span><span class='period'>.</span><span class='id identifier rubyid_each'>each</span> <span class='lbrace'>{</span> <span class='op'>|</span><span class='id identifier rubyid_el'>el</span><span class='op'>|</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='rbrace'>}</span>
+  <span class='id identifier rubyid_data_set'>data_set</span><span class='period'>.</span><span class='id identifier rubyid_each'>each</span> <span class='lbrace'>{</span> <span class='op'>|</span><span class='id identifier rubyid_el'>el</span><span class='op'>|</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='rbrace'>}</span>
 <span class='kw'>end</span></pre>
     </td>
   </tr>
@@ -411,12 +409,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-324
-325
-326</pre>
+334
+335
+336</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 324</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 334</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>
@@ -463,12 +461,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-320
-321
-322</pre>
+330
+331
+332</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 320</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 330</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>
@@ -493,12 +491,12 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-316
-317
-318</pre>
+326
+327
+328</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 316</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 326</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>
@@ -517,36 +515,25 @@ Complexity: O(n).</p>
   
 
   
-</h3><div class="docstring">
-  <div class="discussion">
-    
-<p>Deletion, Worst-Case Time Complexity: O(1)</p>
-
-
-  </div>
-</div>
-<div class="tags">
-  
-
-</div><table class="source_code">
+</h3><table class="source_code">
   <tr>
     <td>
       <pre class="lines">
 
 
-290
-291
-292
-293
-294
-295
-296
-297
-298
-299</pre>
+300
+301
+302
+303
+304
+305
+306
+307
+308
+309</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 290</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 300</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>
@@ -589,18 +576,18 @@ Complexity: O(n).</p>
       <pre class="lines">
 
 
-302
-303
-304
-305
-306
-307
-308
-309
-310</pre>
+312
+313
+314
+315
+316
+317
+318
+319
+320</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 302</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 312</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>
@@ -643,22 +630,22 @@ Complexity: O(n)</p>
       <pre class="lines">
 
 
-275
-276
-277
-278
-279
-280
-281
-282
-283
-284
-285
 286
-287</pre>
+287
+288
+289
+290
+291
+292
+293
+294
+295
+296
+297
+298</pre>
     </td>
     <td>
-      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 275</span>
+      <pre class="code"><span class="info file"># File 'lib/algorithm_selector.rb', line 286</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>
@@ -693,12 +680,12 @@ Complexity: O(n)</p>
       <pre class="lines">
 
 
-312
-313
-314</pre>
+322
+323
+324</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 322</span>
 
 <span class='kw'>def</span> <span class='id identifier rubyid_size'>size</span>
   <span class='ivar'>@size</span>
@@ -713,7 +700,7 @@ Complexity: O(n)</p>
 </div>
 
       <div id="footer">
-  Generated on Fri Jul 22 11:22:30 2016 by
+  Generated on Sat Jul 23 23:26:27 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 Fri Jul 22 11:22:30 2016 by
+  Generated on Sat Jul 23 23:26:27 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

@@ -60,7 +60,152 @@
       <iframe id="search_frame" src="file_list.html"></iframe>
 
       <div id="content"><div id='filecontents'>
-<h1 id="label-AlgorithmSelector">AlgorithmSelector</h1>
+<h1 id="label-algorithm_selector+rdoc-image-3Ahttps-3A-2F-2Fbadge.fury.io-2Frb-2Falgorithm_selector.svg">algorithm_selector <a href="https://badge.fury.io/rb/algorithm_selector"><img src="https://badge.fury.io/rb/algorithm_selector.svg"></a></h1>
+<ul><li>
+<p><a href="https://rubygems.org/gems/algorithm_selector">Live</a></p>
+</li><li>
+<p><a href="http://www.rubydoc.info/gems/algorithm_selector">Documentation</a></p>
+</li></ul>
+
+<h2 id="label-Description">Description</h2>
+
+<p>Calculates algorithms and data structures for sorting and searching.
+Selects best one to use for particular data set.</p>
+
+<p>Additionally, data structures can be used for own purposes. All data
+structures have the ability to insert and search. Will add deletion in the
+future.</p>
+
+<p>Written by Joseph Bui.</p>
+
+<h3 id="label-Currently+supports+the+following+algorithms+and+data+structures-3A">Currently supports the following algorithms and data structures:</h3>
+<ul><li>
+<p>Sorting (<code>&quot;sort&quot;</code>)</p>
+</li><li>
+<p>Bubble Sort (<code>&quot;bubble_sort&quot;</code>)</p>
+</li><li>
+<p>Insertion Sort (<code>&quot;insertion_sort&quot;</code>)</p>
+</li><li>
+<p>Selection Sort (<code>&quot;selection_sort&quot;</code>)</p>
+</li><li>
+<p>Merge Sort (<code>&quot;merge_sort&quot;</code>)</p>
+</li><li>
+<p>Quick Sort(<code>&quot;quick_sort&quot;</code>)</p>
+</li><li>
+<p>Searching (<code>&quot;search&quot;</code>)</p>
+</li><li>
+<p>Stack (<code>&quot;stack&quot;</code>)</p>
+</li><li>
+<p>Queue (<code>&quot;queue&quot;</code>)</p>
+</li><li>
+<p>Singly-Linked List (<code>&quot;linked_list&quot;</code>)</p>
+</li><li>
+<p>Binary Search Tree (<code>&quot;binary_tree&quot;</code>)</p>
+</li></ul>
+
+<h3 id="label-Parameters">Parameters</h3>
+<ul><li>
+<p><code>action</code> is the string of the action, can be
+<code>&quot;sort&quot;</code> or <code>&quot;search&quot;</code></p>
+</li><li>
+<p><code>data_set</code> has to be in array format</p>
+</li><li>
+<p><code>trials</code> is number of test trials (optional, default = 1)</p>
+</li><li>
+<p><code>target</code> is element user wants to search (unnecessary for
+<code>sort</code>, default = null)</p>
+</li><li>
+<p><code>algorithm</code> is the string of the algorithm or data structure</p>
+</li></ul>
+
+<h3 id="label-Methods">Methods</h3>
+<ul><li>
+<p><code>all(action, data_set, trials, target)</code></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><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><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><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><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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
 
 <h2 id="label-Installation">Installation</h2>
 
@@ -83,26 +228,6 @@
 
 <pre class="code ruby"><code class="ruby">$ require &#39;algorithm_selector&#39;</code></pre>
 
-<h3 id="label-Saying+hello">Saying hello</h3>
-
-<p>You can create a string “hello” by using the test method. For example:</p>
-
-<p><a href="1">AlgorithmSelector.test(</a>)  #=&gt; “hello”</p>
-
-<h2 id="label-Development">Development</h2>
-
-<p>After checking out the repo, run <code>bin/setup</code> to install
-dependencies. Then, run <code>rake spec</code> to run the tests. You can
-also run <code>bin/console</code> for an interactive prompt that will allow
-you to experiment.</p>
-
-<p>To install this gem onto your local machine, run <code>bundle exec rake
-install</code>. To release a new version, update the version number in
-<code>version.rb</code>, and then run <code>bundle exec rake
-release</code>, which will create a git tag for the version, push git
-commits and tags, and push the <code>.gem</code> file to <a
-href="https://rubygems.org">rubygems.org</a>.</p>
-
 <h2 id="label-Contributing">Contributing</h2>
 
 <p>Bug reports and pull requests are welcome on GitHub at <a
@@ -119,7 +244,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Fri Jul 22 11:22:30 2016 by
+  Generated on Sat Jul 23 23:26:27 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

@@ -60,7 +60,152 @@
       <iframe id="search_frame" src="class_list.html"></iframe>
 
       <div id="content"><div id='filecontents'>
-<h1 id="label-AlgorithmSelector">AlgorithmSelector</h1>
+<h1 id="label-algorithm_selector+rdoc-image-3Ahttps-3A-2F-2Fbadge.fury.io-2Frb-2Falgorithm_selector.svg">algorithm_selector <a href="https://badge.fury.io/rb/algorithm_selector"><img src="https://badge.fury.io/rb/algorithm_selector.svg"></a></h1>
+<ul><li>
+<p><a href="https://rubygems.org/gems/algorithm_selector">Live</a></p>
+</li><li>
+<p><a href="http://www.rubydoc.info/gems/algorithm_selector">Documentation</a></p>
+</li></ul>
+
+<h2 id="label-Description">Description</h2>
+
+<p>Calculates algorithms and data structures for sorting and searching.
+Selects best one to use for particular data set.</p>
+
+<p>Additionally, data structures can be used for own purposes. All data
+structures have the ability to insert and search. Will add deletion in the
+future.</p>
+
+<p>Written by Joseph Bui.</p>
+
+<h3 id="label-Currently+supports+the+following+algorithms+and+data+structures-3A">Currently supports the following algorithms and data structures:</h3>
+<ul><li>
+<p>Sorting (<code>&quot;sort&quot;</code>)</p>
+</li><li>
+<p>Bubble Sort (<code>&quot;bubble_sort&quot;</code>)</p>
+</li><li>
+<p>Insertion Sort (<code>&quot;insertion_sort&quot;</code>)</p>
+</li><li>
+<p>Selection Sort (<code>&quot;selection_sort&quot;</code>)</p>
+</li><li>
+<p>Merge Sort (<code>&quot;merge_sort&quot;</code>)</p>
+</li><li>
+<p>Quick Sort(<code>&quot;quick_sort&quot;</code>)</p>
+</li><li>
+<p>Searching (<code>&quot;search&quot;</code>)</p>
+</li><li>
+<p>Stack (<code>&quot;stack&quot;</code>)</p>
+</li><li>
+<p>Queue (<code>&quot;queue&quot;</code>)</p>
+</li><li>
+<p>Singly-Linked List (<code>&quot;linked_list&quot;</code>)</p>
+</li><li>
+<p>Binary Search Tree (<code>&quot;binary_tree&quot;</code>)</p>
+</li></ul>
+
+<h3 id="label-Parameters">Parameters</h3>
+<ul><li>
+<p><code>action</code> is the string of the action, can be
+<code>&quot;sort&quot;</code> or <code>&quot;search&quot;</code></p>
+</li><li>
+<p><code>data_set</code> has to be in array format</p>
+</li><li>
+<p><code>trials</code> is number of test trials (optional, default = 1)</p>
+</li><li>
+<p><code>target</code> is element user wants to search (unnecessary for
+<code>sort</code>, default = null)</p>
+</li><li>
+<p><code>algorithm</code> is the string of the algorithm or data structure</p>
+</li></ul>
+
+<h3 id="label-Methods">Methods</h3>
+<ul><li>
+<p><code>all(action, data_set, trials, target)</code></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><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><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><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><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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
+
+<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>
+</li></ul>
 
 <h2 id="label-Installation">Installation</h2>
 
@@ -83,26 +228,6 @@
 
 <pre class="code ruby"><code class="ruby">$ require &#39;algorithm_selector&#39;</code></pre>
 
-<h3 id="label-Saying+hello">Saying hello</h3>
-
-<p>You can create a string “hello” by using the test method. For example:</p>
-
-<p><a href="1">AlgorithmSelector.test(</a>)  #=&gt; “hello”</p>
-
-<h2 id="label-Development">Development</h2>
-
-<p>After checking out the repo, run <code>bin/setup</code> to install
-dependencies. Then, run <code>rake spec</code> to run the tests. You can
-also run <code>bin/console</code> for an interactive prompt that will allow
-you to experiment.</p>
-
-<p>To install this gem onto your local machine, run <code>bundle exec rake
-install</code>. To release a new version, update the version number in
-<code>version.rb</code>, and then run <code>bundle exec rake
-release</code>, which will create a git tag for the version, push git
-commits and tags, and push the <code>.gem</code> file to <a
-href="https://rubygems.org">rubygems.org</a>.</p>
-
 <h2 id="label-Contributing">Contributing</h2>
 
 <p>Bug reports and pull requests are welcome on GitHub at <a
@@ -119,7 +244,7 @@ href="http://opensource.org/licenses/MIT">MIT License</a>.</p>
 </div></div>
 
       <div id="footer">
-  Generated on Fri Jul 22 11:22:30 2016 by
+  Generated on Sat Jul 23 23:26:27 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>