From 19bd8745e4c3effb016fb0c12ab9fddef6fe607d Mon Sep 17 00:00:00 2001 From: Chris Boesch Date: Mon, 6 May 2024 09:13:56 +0200 Subject: Fix some typos --- exercises/097_bit_manipulation.zig | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'exercises/097_bit_manipulation.zig') diff --git a/exercises/097_bit_manipulation.zig b/exercises/097_bit_manipulation.zig index 424fb4c..03fc72d 100644 --- a/exercises/097_bit_manipulation.zig +++ b/exercises/097_bit_manipulation.zig @@ -1,5 +1,5 @@ // -// Bit manipulations is a very powerful tool just also from Zig. +// Bit manipulation is a very powerful tool, also from Zig. // Since the dawn of the computer age, numerous algorithms have been // developed that solve tasks solely by moving, setting, or logically // combining bits. @@ -8,10 +8,10 @@ // functions where possible. And it is often possible with calculations // based on integers. // -// Often it is not easy to understand at first glance what exactly these +// At first glance, it is often not easy to understand what exactly these // algorithms do when only "numbers" in memory areas change outwardly. -// But it must never be forgotten that the numbers only represent the -// interpretation of the bit sequences. +// However, it should never be forgotten that the numbers only represent +// the interpretation of the bit sequences. // // Quasi the reversed case we have otherwise, namely that we represent // numbers in bit sequences. @@ -21,7 +21,7 @@ // Zig provides all the necessary functions to change the bits inside // a variable. It is distinguished whether the bit change leads to an // overflow or not. The details are in the Zig documentation in section -// 10.1 "Table of Operators". +// "Table of Operators". // // Here are some examples of how the bits of variables can be changed: // -- cgit v1.2.3-70-g09d2