nil

Ariana1729 · Ariana1729 · commit 839416e99693 · 2018-10-12T00:39:25.000+08:00
diff --git a/contents/thomas_algorithm/thomas_algorithm.md b/contents/thomas_algorithm/thomas_algorithm.md
@@ -1,4 +1,4 @@
-s# Thomas Algorithm
+# Thomas Algorithm
 
 As alluded to in the [Gaussian Elimination chapter](../gaussian_elimination/gaussian_elimination.md), the Thomas Algorithm (or TDMA, Tri-Diagonal Matrix Algorithm) allows for programmers to **massively** cut the computational cost of their code from $$ O(n^3)$$ to $$O(n)$$ in certain cases!
 This is done by exploiting a particular case of Gaussian Elimination where the matrix looks like this:

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-s# Thomas Algorithm`
	`1`	`+# Thomas Algorithm`
`2`	`2`
`3`	`3`	`As alluded to in the [Gaussian Elimination chapter](../gaussian_elimination/gaussian_elimination.md), the Thomas Algorithm (or TDMA, Tri-Diagonal Matrix Algorithm) allows for programmers to massively cut the computational cost of their code from $$ O(n^3)$$ to $$O(n)$$ in certain cases!`
`4`	`4`	`This is done by exploiting a particular case of Gaussian Elimination where the matrix looks like this:`