hello-algo/zh-hant/codes/zig/chapter_computational_complexity/iteration.zig

// File: iteration.zig
// Created Time: 2023-09-27
// Author: QiLOL (pikaqqpika@gmail.com)

const std = @import("std");
const Allocator = std.mem.Allocator;

// for 迴圈
fn forLoop(n: usize) i32 {
    var res: i32 = 0;
    // 迴圈求和 1, 2, ..., n-1, n
    for (1..n+1) |i| {
        res = res + @as(i32, @intCast(i));
    }
    return res;
} 

// while 迴圈
fn whileLoop(n: i32) i32 {
    var res: i32 = 0;
    var i: i32 = 1; // 初始化條件變數
    // 迴圈求和 1, 2, ..., n-1, n
    while (i <= n) {
        res += @intCast(i);
        i += 1;
    }
    return res;
}

//  while 迴圈（兩次更新）
fn whileLoopII(n: i32) i32 {
    var res: i32 = 0;
    var i: i32 = 1; // 初始化條件變數
    // 迴圈求和 1, 4, 10, ...
    while (i <= n) {
        res += @intCast(i);
        // 更新條件變數
        i += 1;
        i *= 2;
    }
    return res;
}

// 雙層 for 迴圈
fn nestedForLoop(allocator: Allocator, n: usize) ![]const u8 {
    var res = std.ArrayList(u8).init(allocator);
    defer res.deinit();
    var buffer: [20]u8 = undefined;
    // 迴圈 i = 1, 2, ..., n-1, n
    for (1..n+1) |i| {
        // 迴圈 j = 1, 2, ..., n-1, n
        for (1..n+1) |j| {
            var _str = try std.fmt.bufPrint(&buffer, "({d}, {d}), ", .{i, j});
            try res.appendSlice(_str);
        }
    }
    return res.toOwnedSlice();
}

// Driver Code
pub fn main() !void {
    const n: i32 = 5;
    var res: i32 = 0;

    res = forLoop(n);
    std.debug.print("\nfor 迴圈的求和結果 res = {}\n", .{res});

    res = whileLoop(n);
    std.debug.print("\nwhile 迴圈的求和結果 res = {}\n", .{res});

    res = whileLoopII(n);
    std.debug.print("\nwhile 迴圈（兩次更新）求和結果 res = {}\n", .{res});

    const allocator = std.heap.page_allocator;
    const resStr = try nestedForLoop(allocator, n);
    std.debug.print("\n雙層 for 迴圈的走訪結果 {s}\n", .{resStr});
}