summaryrefslogtreecommitdiff
path: root/exercises/105_threading2.zig
diff options
context:
space:
mode:
authorChris Boesch <chrboesch@noreply.codeberg.org>2025-03-22 10:47:00 +0000
committerChris Boesch <chrboesch@noreply.codeberg.org>2025-03-22 10:47:00 +0000
commitd7052e4137a1e9de62ba8e10800642339e2b8eff (patch)
treeeb23e473b503541f1a6fa4cc9ce1e8b74ba6d88d /exercises/105_threading2.zig
parent7ce659f7fa670720510a6afd23cb63366e1adde9 (diff)
parent522b4673a426258d1299abd75021a9510644f9ba (diff)
Merge pull request 'fix: typos' (#222) from ddogfoodd/exercises:main into main
Reviewed-on: https://codeberg.org/ziglings/exercises/pulls/222
Diffstat (limited to 'exercises/105_threading2.zig')
-rw-r--r--exercises/105_threading2.zig6
1 files changed, 3 insertions, 3 deletions
diff --git a/exercises/105_threading2.zig b/exercises/105_threading2.zig
index 7e16a1c..374391a 100644
--- a/exercises/105_threading2.zig
+++ b/exercises/105_threading2.zig
@@ -21,9 +21,9 @@
// There were the Scottish mathematician Gregory and the German
// mathematician Leibniz, and even a few hundred years earlier the Indian
// mathematician Madhava. All of them independently developed the same
-// formula, which was published by Leibnitz in 1682 in the journal
+// formula, which was published by Leibniz in 1682 in the journal
// "Acta Eruditorum".
-// This is why this method has become known as the "Leibnitz series",
+// This is why this method has become known as the "Leibniz series",
// although the other names are also often used today.
// We will not go into the formula and its derivation in detail, but
// will deal with the series straight away:
@@ -50,7 +50,7 @@
// enough for us for now, because we want to understand the principle and
// nothing more, right?
//
-// As we have already discovered, the Leibnitz series is a series with a
+// As we have already discovered, the Leibniz series is a series with a
// fixed distance of 2 between the individual partial values. This makes
// it easy to apply a simple loop to it, because if we start with n = 1
// (which is not necessarily useful now) we always have to add 2 in each