code: update zig 0.14.1 for the chapter of array_and_linkedlist and computational_complexity (#1787)

* update zig array list chapter

* update not need change codes.

* fix some pr issues and update time space chapter

codes/zig/chapter_computational_complexity/time_complexity.zig

@@ -1,6 +1,6 @@
 // File: time_complexity.zig
 // Created Time: 2022-12-28
-// Author: codingonion (coderonion@gmail.com)
+// Author: codingonion (coderonion@gmail.com), CreatorMetaSky (creator_meta_sky@163.com)
 
 const std = @import("std");
 
@@ -10,7 +10,7 @@ fn constant(n: i32) i32 {
     var count: i32 = 0;
     const size: i32 = 100_000;
     var i: i32 = 0;
-    while(i<size) : (i += 1) {
+    while (i < size) : (i += 1) {
         count += 1;
     }
     return count;
@@ -52,7 +52,7 @@ fn quadratic(n: i32) i32 {
 
 // 平方阶（冒泡排序）
 fn bubbleSort(nums: []i32) i32 {
-    var count: i32 = 0;  // 计数器 
+    var count: i32 = 0; // 计数器
     // 外循环：未排序区间为 [0, i]
     var i: i32 = @as(i32, @intCast(nums.len)) - 1;
     while (i > 0) : (i -= 1) {
@@ -61,10 +61,10 @@ fn bubbleSort(nums: []i32) i32 {
         while (j < i) : (j += 1) {
             if (nums[j] > nums[j + 1]) {
                 // 交换 nums[j] 与 nums[j + 1]
-                var tmp = nums[j];
+                const tmp = nums[j];
                 nums[j] = nums[j + 1];
                 nums[j + 1] = tmp;
-                count += 3;  // 元素交换包含 3 个单元操作
+                count += 3; // 元素交换包含 3 个单元操作
             }
         }
     }
@@ -97,11 +97,9 @@ fn expRecur(n: i32) i32 {
 // 对数阶（循环实现）
 fn logarithmic(n: i32) i32 {
     var count: i32 = 0;
-    var n_var = n;
-    while (n_var > 1)
-    {
-        n_var = n_var / 2;
-        count +=1;
+    var n_var: i32 = n;
+    while (n_var > 1) : (n_var = @divTrunc(n_var, 2)) {
+        count += 1;
     }
     return count;
 }
@@ -109,13 +107,13 @@ fn logarithmic(n: i32) i32 {
 // 对数阶（递归实现）
 fn logRecur(n: i32) i32 {
     if (n <= 1) return 0;
-    return logRecur(n / 2) + 1;
+    return logRecur(@divTrunc(n, 2)) + 1;
 }
 
 // 线性对数阶
 fn linearLogRecur(n: i32) i32 {
     if (n <= 1) return 1;
-    var count: i32 = linearLogRecur(n / 2) + linearLogRecur(n / 2);
+    var count: i32 = linearLogRecur(@divTrunc(n, 2)) + linearLogRecur(@divTrunc(n, 2));
     var i: i32 = 0;
     while (i < n) : (i += 1) {
         count += 1;
@@ -136,7 +134,7 @@ fn factorialRecur(n: i32) i32 {
 }
 
 // Driver Code
-pub fn main() !void {
+pub fn run() void {
     // 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势
     const n: i32 = 8;
     std.debug.print("输入数据大小 n = {}\n", .{n});
@@ -146,14 +144,14 @@ pub fn main() !void {
 
     count = linear(n);
     std.debug.print("线性阶的操作数量 = {}\n", .{count});
-    var nums = [_]i32{0}**n;
+    var nums = [_]i32{0} ** n;
     count = arrayTraversal(&nums);
     std.debug.print("线性阶（遍历数组）的操作数量 = {}\n", .{count});
 
     count = quadratic(n);
     std.debug.print("平方阶的操作数量 = {}\n", .{count});
     for (&nums, 0..) |*num, i| {
-        num.* = n - @as(i32, @intCast(i));  // [n,n-1,...,2,1]
+        num.* = n - @as(i32, @intCast(i)); // [n,n-1,...,2,1]
     }
     count = bubbleSort(&nums);
     std.debug.print("平方阶（冒泡排序）的操作数量 = {}\n", .{count});
@@ -174,6 +172,13 @@ pub fn main() !void {
     count = factorialRecur(n);
     std.debug.print("阶乘阶（递归实现）的操作数量 = {}\n", .{count});
 
-    _ = try std.io.getStdIn().reader().readByte();
+    std.debug.print("\n", .{});
 }
 
+pub fn main() !void {
+    run();
+}
+
+test "time_complexity" {
+    run();
+}