aboutsummaryrefslogtreecommitdiff
path: root/exercises/011_while.zig
diff options
context:
space:
mode:
authorDave Gauer <dave@ratfactor.com>2021-03-12 18:59:46 -0500
committerDave Gauer <dave@ratfactor.com>2021-03-12 18:59:46 -0500
commit6ad9774189fbd64b2f2c9519f4513ab34b0c3809 (patch)
treed6c90700131d5b28e898881f13e2a05612e4703f /exercises/011_while.zig
parentbe36352572ddb18218e1830e49316c259dea5e8c (diff)
downloadziglings-6ad9774189fbd64b2f2c9519f4513ab34b0c3809.tar.gz
ziglings-6ad9774189fbd64b2f2c9519f4513ab34b0c3809.tar.bz2
ziglings-6ad9774189fbd64b2f2c9519f4513ab34b0c3809.tar.xz
ziglings-6ad9774189fbd64b2f2c9519f4513ab34b0c3809.zip
"999 is enough for anybody" triple-zero padding (#18)
When I hit 999 exercises, I will finally have reached the ultimate state of soteriological release and no more exercises will be needed. The cycle will be complete. All that will be left is perfect quietude, freedom, and highest happiness.
Diffstat (limited to 'exercises/011_while.zig')
-rw-r--r--exercises/011_while.zig34
1 files changed, 34 insertions, 0 deletions
diff --git a/exercises/011_while.zig b/exercises/011_while.zig
new file mode 100644
index 0000000..674d904
--- /dev/null
+++ b/exercises/011_while.zig
@@ -0,0 +1,34 @@
+//
+// Zig 'while' statements create a loop that runs while the
+// condition is true. This runs once (at most):
+//
+// while (condition) {
+// condition = false;
+// }
+//
+// Remember that the condition must be a boolean value and
+// that we can get a boolean value from conditional operators
+// such as:
+//
+// a == b means "a equals b"
+// a < b means "a is less than b"
+// a > b means "a is greater than b"
+// a != b means "a does not equal b"
+//
+const std = @import("std");
+
+pub fn main() void {
+ var n: u32 = 2;
+
+ // Please use a condition that is true UNTIL "n" reaches 1024:
+ while (???) {
+ // Print the current number
+ std.debug.print("{} ", .{n});
+
+ // Set n to n multiplied by 2
+ n *= 2;
+ }
+
+ // Once the above is correct, this will print "n=1024"
+ std.debug.print("n={}\n", .{n});
+}