Merge pull request #259 from kellybelly/master

fix typos in algorithms slides

algorithms/index.html

@@ -782,7 +782,7 @@ <h2>Binary Search: Steps</h2><br>
                   <ul>
                       <li>Pick the middle element of the array <em>m</em> and compare it to <em>e</em>.
                       <li>If element values are equal, then return index of <em>m</em>.
-                      <li>If <em>e</em> is greater than me, then <em>e</em> must be in left subarray. If <en>m</en> is greater than <em>e</em>, <em>e</em> must be in the right subarray.
+                      <li>If <em>e</em> is greater than <em>m</em>, then <em>e</em> must be in left subarray. If <em>m</em> is greater than <em>e</em>, then <em>e</em> must be in the right subarray.
                   </ul>
                 <li>Repeat those steps on new subarray.</li>
               </ul>