From e5c1947ffa3b5cf2a8ff3259542a7dda9e50b9b2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Antonio=20Hern=C3=A1ndez=20C=C3=A1novas?=
 <juanantoniohernandezcanovas@gmail.com>
Date: Tue, 9 Oct 2018 18:31:10 +0200
Subject: [PATCH 1/5] add thomas algorithm in javascript

---
 .../code/javascript/thomas.js                 | 31 +++++++++++++++++++
 contents/thomas_algorithm/thomas_algorithm.md |  2 ++
 2 files changed, 33 insertions(+)
 create mode 100644 contents/thomas_algorithm/code/javascript/thomas.js

diff --git a/contents/thomas_algorithm/code/javascript/thomas.js b/contents/thomas_algorithm/code/javascript/thomas.js
new file mode 100644
index 000000000..fddab21d0
--- /dev/null
+++ b/contents/thomas_algorithm/code/javascript/thomas.js
@@ -0,0 +1,31 @@
+function thomas(a, b, c, x) {
+	let y = [];
+
+	y[0] = c[0] / b[0];
+	x[0] = x[0] / b[0];
+
+	for (let i = 1; i < a.length; i++) {
+		let scale = 1.0 / (b[i] - a[i] * y[i - 1]);
+		y[i] = c[i] * scale;
+		x[i] = (x[i] - a[i] * x[i - 1]) * scale;
+	}
+
+	for (let i = a.length - 2; i >= 0; i--)
+		x[i] -= y[i] * x[i + 1];
+}
+
+let a = [0.0, 2.0, 3.0];
+let b = [1.0, 3.0, 6.0];
+let c = [4.0, 5.0, 0.0];
+let x = [7.0, 5.0, 3.0];
+
+console.log("The system,");
+console.log("[1.0  4.0  0.0][x] = [7.0]");
+console.log("[2.0  3.0  5.0][y] = [5.0]");
+console.log("[0.0  3.0  6.0][z] = [3.0]");
+console.log("has the solution:\n");
+
+thomas(a, b, c, x);
+
+for (let i = 0; i < 3; i++)
+	console.log("[" + x[i] + "]");
diff --git a/contents/thomas_algorithm/thomas_algorithm.md b/contents/thomas_algorithm/thomas_algorithm.md
index 885739421..11f74f159 100644
--- a/contents/thomas_algorithm/thomas_algorithm.md
+++ b/contents/thomas_algorithm/thomas_algorithm.md
@@ -119,6 +119,8 @@ You will find this algorithm implemented [in this project](https://scratch.mit.e
 [import, lang:"nim"](code/nim/thomas_algorithm.nim)
 {% sample lang="cpp" %}
 [import, lang:"c_cpp"](code/c++/thomas.cpp)
+{% sample lang="js" %}
+[import, lang:"javascript"](code/javascript/thomas.js)
 {% endmethod %}
 
 <script>

From 8cec2e6cfd6f101f9c02ad4b85f9ce5fcfb9b1fc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Antonio=20Hern=C3=A1ndez=20C=C3=A1novas?=
 <juanantoniohernandezcanovas@gmail.com>
Date: Tue, 9 Oct 2018 22:52:26 +0200
Subject: [PATCH 2/5] simplified printing of solution

---
 contents/thomas_algorithm/code/javascript/thomas.js | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/contents/thomas_algorithm/code/javascript/thomas.js b/contents/thomas_algorithm/code/javascript/thomas.js
index fddab21d0..9dd475f62 100644
--- a/contents/thomas_algorithm/code/javascript/thomas.js
+++ b/contents/thomas_algorithm/code/javascript/thomas.js
@@ -23,9 +23,6 @@ console.log("The system,");
 console.log("[1.0  4.0  0.0][x] = [7.0]");
 console.log("[2.0  3.0  5.0][y] = [5.0]");
 console.log("[0.0  3.0  6.0][z] = [3.0]");
-console.log("has the solution:\n");
+console.log("has the solution:\n", x);
 
 thomas(a, b, c, x);
-
-for (let i = 0; i < 3; i++)
-	console.log("[" + x[i] + "]");

From cd17d98b35d85029707404f56e35f5b975ba7bd4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Antonio=20Hern=C3=A1ndez=20C=C3=A1novas?=
 <juanantoniohernandezcanovas@gmail.com>
Date: Fri, 12 Oct 2018 18:07:51 +0200
Subject: [PATCH 3/5] corrected code style

---
 .../thomas_algorithm/code/javascript/thomas.js | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/contents/thomas_algorithm/code/javascript/thomas.js b/contents/thomas_algorithm/code/javascript/thomas.js
index 9dd475f62..db76e56a6 100644
--- a/contents/thomas_algorithm/code/javascript/thomas.js
+++ b/contents/thomas_algorithm/code/javascript/thomas.js
@@ -1,28 +1,28 @@
 function thomas(a, b, c, x) {
-	let y = [];
+	const y = [];
 
 	y[0] = c[0] / b[0];
 	x[0] = x[0] / b[0];
 
 	for (let i = 1; i < a.length; i++) {
-		let scale = 1.0 / (b[i] - a[i] * y[i - 1]);
+		const scale = 1 / (b[i] - a[i] * y[i - 1]);
 		y[i] = c[i] * scale;
 		x[i] = (x[i] - a[i] * x[i - 1]) * scale;
 	}
 
 	for (let i = a.length - 2; i >= 0; i--)
 		x[i] -= y[i] * x[i + 1];
+
+	return x;
 }
 
-let a = [0.0, 2.0, 3.0];
-let b = [1.0, 3.0, 6.0];
-let c = [4.0, 5.0, 0.0];
-let x = [7.0, 5.0, 3.0];
+let a = [0, 2, 3];
+let b = [1, 3, 6];
+let c = [4, 5, 0];
+let x = [7, 5, 3];
 
 console.log("The system,");
 console.log("[1.0  4.0  0.0][x] = [7.0]");
 console.log("[2.0  3.0  5.0][y] = [5.0]");
 console.log("[0.0  3.0  6.0][z] = [3.0]");
-console.log("has the solution:\n", x);
-
-thomas(a, b, c, x);
+console.log("has the solution:\n", thomas(a, b, c, x));
\ No newline at end of file

From b456c5a98d7b30d43d358a12c4198e29d4730224 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Antonio=20Hern=C3=A1ndez=20C=C3=A1novas?=
 <juanantoniohernandezcanovas@gmail.com>
Date: Fri, 12 Oct 2018 18:10:23 +0200
Subject: [PATCH 4/5] .

---
 .../code/javascript/thomas.js                 | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/contents/thomas_algorithm/code/javascript/thomas.js b/contents/thomas_algorithm/code/javascript/thomas.js
index db76e56a6..0cec97203 100644
--- a/contents/thomas_algorithm/code/javascript/thomas.js
+++ b/contents/thomas_algorithm/code/javascript/thomas.js
@@ -1,19 +1,19 @@
 function thomas(a, b, c, x) {
-	const y = [];
+  const y = [];
 
-	y[0] = c[0] / b[0];
-	x[0] = x[0] / b[0];
+  y[0] = c[0] / b[0];
+  x[0] = x[0] / b[0];
 
-	for (let i = 1; i < a.length; i++) {
-		const scale = 1 / (b[i] - a[i] * y[i - 1]);
-		y[i] = c[i] * scale;
-		x[i] = (x[i] - a[i] * x[i - 1]) * scale;
-	}
+  for (let i = 1; i < a.length; i++) {
+    const scale = 1 / (b[i] - a[i] * y[i - 1]);
+    y[i] = c[i] * scale;
+    x[i] = (x[i] - a[i] * x[i - 1]) * scale;
+  }
 
-	for (let i = a.length - 2; i >= 0; i--)
-		x[i] -= y[i] * x[i + 1];
+  for (let i = a.length - 2; i >= 0; i--)
+    x[i] -= y[i] * x[i + 1];
 
-	return x;
+  return x;
 }
 
 let a = [0, 2, 3];
@@ -25,4 +25,4 @@ console.log("The system,");
 console.log("[1.0  4.0  0.0][x] = [7.0]");
 console.log("[2.0  3.0  5.0][y] = [5.0]");
 console.log("[0.0  3.0  6.0][z] = [3.0]");
-console.log("has the solution:\n", thomas(a, b, c, x));
\ No newline at end of file
+console.log("has the solution:\n", thomas(a, b, c, x));

From eb04d8c7357320f73d5e83ecbbd6739d44085d23 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Juan=20Antonio=20Hern=C3=A1ndez=20C=C3=A1novas?=
 <juanantoniohernandezcanovas@gmail.com>
Date: Sun, 14 Oct 2018 23:42:56 +0200
Subject: [PATCH 5/5] corrected return value

---
 contents/thomas_algorithm/code/javascript/thomas.js | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/contents/thomas_algorithm/code/javascript/thomas.js b/contents/thomas_algorithm/code/javascript/thomas.js
index 0cec97203..d6e2b89a8 100644
--- a/contents/thomas_algorithm/code/javascript/thomas.js
+++ b/contents/thomas_algorithm/code/javascript/thomas.js
@@ -1,19 +1,20 @@
 function thomas(a, b, c, x) {
+  const result = [];
   const y = [];
 
   y[0] = c[0] / b[0];
-  x[0] = x[0] / b[0];
+  result[0] = x[0] / b[0];
 
   for (let i = 1; i < a.length; i++) {
     const scale = 1 / (b[i] - a[i] * y[i - 1]);
     y[i] = c[i] * scale;
-    x[i] = (x[i] - a[i] * x[i - 1]) * scale;
+    result[i] = (x[i] - a[i] * result[i - 1]) * scale;
   }
 
   for (let i = a.length - 2; i >= 0; i--)
-    x[i] -= y[i] * x[i + 1];
+    result[i] -= y[i] * result[i + 1];
 
-  return x;
+  return result;
 }
 
 let a = [0, 2, 3];