Add build script for Go and update Go codes.

docs/chapter_computational_complexity/time_complexity.md

@@ -813,15 +813,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 常数阶 */
-    func constant(n int) int {
-        count := 0
-        size := 100000
-        for i := 0; i < size; i++ {
-            count ++
-        }
-        return count
-    }
+    [class]{}-[func]{constant}
     ```
 
 === "JavaScript"
@@ -904,14 +896,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 线性阶 */
-    func linear(n int) int {
-        count := 0
-        for i := 0; i < n; i++ {
-            count++
-        }
-        return count
-    }
+    [class]{}-[func]{linear}
     ```
 
 === "JavaScript"
@@ -992,15 +977,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 线性阶（遍历数组） */
-    func arrayTraversal(nums []int) int {
-        count := 0
-        // 循环次数与数组长度成正比
-        for range nums {
-            count++
-        }
-        return count
-    }
+    [class]{}-[func]{arrayTraversal}
     ```
 
 === "JavaScript"
@@ -1080,17 +1057,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 平方阶 */
-    func quadratic(n int) int {
-        count := 0
-        // 循环次数与数组长度成平方关系
-        for i := 0; i < n; i++ {
-            for j := 0; j < n; j++ {
-                count++
-            }
-        }
-        return count
-    }
+    [class]{}-[func]{quadratic}
     ```
 
 === "JavaScript"
@@ -1182,24 +1149,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 平方阶（冒泡排序） */
-    func bubbleSort(nums []int) int {
-        count := 0 // 计数器
-        // 外循环：待排序元素数量为 n-1, n-2, ..., 1
-        for i := len(nums) - 1; i > 0; i-- {
-            // 内循环：冒泡操作
-            for j := 0; j < i; j++ {
-                if nums[j] > nums[j+1] {
-                    // 交换 nums[j] 与 nums[j + 1]
-                    tmp := nums[j]
-                    nums[j] = nums[j+1]
-                    nums[j+1] = tmp
-                    count += 3 // 元素交换包含 3 个单元操作
-                }
-            }
-        }
-        return count
-    }
+    [class]{}-[func]{bubbleSort}
     ```
 
 === "JavaScript"
@@ -1305,19 +1255,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 指数阶（循环实现）*/
-    func exponential(n int) int {
-        count, base := 0, 1
-        // cell 每轮一分为二，形成数列 1, 2, 4, 8, ..., 2^(n-1)
-        for i := 0; i < n; i++ {
-            for j := 0; j < base; j++ {
-                count++
-            }
-            base *= 2
-        }
-        // count = 1 + 2 + 4 + 8 + .. + 2^(n-1) = 2^n - 1
-        return count
-    }
+    [class]{}-[func]{exponential}
     ```
 
 === "JavaScript"
@@ -1411,13 +1349,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 指数阶（递归实现）*/
-    func expRecur(n int) int {
-        if n == 1 {
-            return 1
-        }
-        return expRecur(n-1) + expRecur(n-1) + 1
-    }
+    [class]{}-[func]{expRecur}
     ```
 
 === "JavaScript"
@@ -1493,15 +1425,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 对数阶（循环实现）*/
-    func logarithmic(n float64) int {
-        count := 0
-        for n > 1 {
-            n = n / 2
-            count++
-        }
-        return count
-    }
+    [class]{}-[func]{logarithmic}
     ```
 
 === "JavaScript"
@@ -1586,13 +1510,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 对数阶（递归实现）*/
-    func logRecur(n float64) int {
-        if n <= 1 {
-            return 0
-        }
-        return logRecur(n/2) + 1
-    }
+    [class]{}-[func]{logRecur}
     ```
 
 === "JavaScript"
@@ -1667,18 +1585,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 线性对数阶 */
-    func linearLogRecur(n float64) int {
-        if n <= 1 {
-            return 1
-        }
-        count := linearLogRecur(n/2) +
-            linearLogRecur(n/2)
-        for i := 0.0; i < n; i++ {
-            count++
-        }
-        return count
-    }
+    [class]{}-[func]{linearLogRecur}
     ```
 
 === "JavaScript"
@@ -1772,18 +1679,7 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-    /* 阶乘阶（递归实现） */
-    func factorialRecur(n int) int {
-        if n == 0 {
-            return 1
-        }
-        count := 0
-        // 从 1 个分裂出 n 个
-        for i := 0; i < n; i++ {
-            count += factorialRecur(n - 1)
-        }
-        return count
-    }
+    [class]{}-[func]{factorialRecur}
     ```
 
 === "JavaScript"