mitteneer/ziglings
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Activity Actions

Fix some typos

Browse source
This commit is contained in:
Chris Boesch 2024-05-06 09:13:56 +02:00
parent e182d1f19d
commit 19bd8745e4
No known key found for this signature in database
GPG key ID: 8712DF4D3E364668
6 changed files with 20 additions and 20 deletions
Download patch file Download diff file Expand all files Collapse all files

10
exercises/097_bit_manipulation.zig
View file

@ -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:
//