first pull reqs

README.md

@@ -168,7 +168,7 @@ __________________
 
 
 
-## [html: Basic Questions for Begginers](http://www.thatjsdude.com/interview/html.html)
+## [html: Basic Questions for Beginners](http://www.thatjsdude.com/interview/html.html)
 
 15 basic questions and asnwers
 ______
@@ -219,4 +219,4 @@ __________________
 4. Graph and high order data structure in JavaScript
 ___________________
 
-Inpsired by, [darcyclarke](https://github.com/darcyclarke/Front-end-Developer-Interview-Questions), [css-tricks](http://css-tricks.com/interview-questions-css/), [david shariff](https://gist.github.com/jesspoemape/87665d65cde3980485ec27cef1602a0d) and some google results. If you want to add any question to this let me know.
+Inpsired by, [darcyclarke](https://github.com/darcyclarke/Front-end-Developer-Interview-Questions), [css-tricks](http://css-tricks.com/interview-questions-css/), [david shariff] and some google results. If you want to add any question to this let me know.

js1.html

@@ -268,6 +268,7 @@ <h2>4. Greatest Common Divisor</h2>
         </code></pre>
         <h3>fancy algorithm</h3>
         <p><strong>Sorry.</strong>  can't explain it. As i myself dont understand it 80% of the times. my algorithm analysis instructor told about this and stole if from class note (i am a good student, btw!)</p>
+        <p>Here's the link to learn about Euclidean Algo <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm">Euclidean Algorithm</a></p>
         <pre><code>
 function greatestCommonDivisor(a, b){
    if(b == 0)

sort.html

@@ -178,6 +178,7 @@ <h2>Insertion sort</h2>
   for(i = 1; i&lt;len; i++){
     el = arr[i];
     j = i;
+    toInsert = el;
 
     while(j>0 && arr[j-1]>toInsert){
       arr[j] = arr[j-1];