From 300a1bda5399e342fbbd87d00bb900b1bd79df8a Mon Sep 17 00:00:00 2001
From: Vamshi Bachaneboina <vamsisai999@gmail.com>
Date: Mon, 17 Sep 2018 16:05:06 +0530
Subject: [PATCH] Update js1.html

Updated - Method 3 for GCD is a bit easier to understand than Method 2 and has better time complexity than Method 1 and equivalent to Method 2.
---
 js1.html | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/js1.html b/js1.html
index 80ce618..92584fe 100644
--- a/js1.html
+++ b/js1.html
@@ -277,6 +277,17 @@ <h3>fancy algorithm</h3>
 }
         </code></pre>
         <p><strong>Note:</strong> use your brain to understand it.</p>
+        
+        <h3>fancy euclidian algorithm</h3>
+        <p>Better time complexity than <strong>Method 1</strong> and equivalent to <strong>Method 2</strong></p>
+        <pre><code>
+const GCD = (a,b) => {
+  while(a != b){
+    [a,b] = a > b ? [a-b, b] : [a, b-a];
+  }
+  return a || b
+}
+        </code></pre>
       </div>
       <div id="removeDuplicate">
         <h2>5. remove Duplicate</h2>