exercises(isogram, nth-prime, pangram, sieve): examples: tweak comments

ee7 · Nov 12, 2023 · 8df62a3 · 8df62a3
1 parent 6d3151e
commit 8df62a3
Show file tree

Hide file tree

Showing 4 changed files with 6 additions and 6 deletions.
diff --git a/exercises/practice/isogram/.meta/example.nim b/exercises/practice/isogram/.meta/example.nim
@@ -1,6 +1,6 @@
 func isIsogram*(s: string): bool =
   result = true
-  var seen: array[26, bool] # Faster than array['a'..'z', bool] or set['a'..'z']
+  var seen: array[26, bool] # Faster than array['a'..'z', bool] or set['a'..'z'].
   for c in s:
     let i = if c in {'a'..'z'}: c.ord - 'a'.ord else: c.ord - 'A'.ord
     if i in {0..seen.high}:

diff --git a/exercises/practice/nth-prime/.meta/example.nim b/exercises/practice/nth-prime/.meta/example.nim
@@ -7,9 +7,9 @@ func eratosthenes(n: int): seq[bool] =
   for odd in countup(3, n, 2):
     result[odd] = true
 
-  for i in countup(3, n.float.sqrt.int, 2): # Optimisation: stop at sqrt(n)
+  for i in countup(3, n.float.sqrt.int, 2): # Optimization: stop at sqrt(n).
     if result[i]:
-      for j in countup(i*i, n, 2*i): # Optimisation: start at i*i
+      for j in countup(i*i, n, 2*i): # Optimization: start at i*i.
         result[j] = false
 
 func primesUpTo(limit: int): seq[int] =

diff --git a/exercises/practice/pangram/.meta/example.nim b/exercises/practice/pangram/.meta/example.nim
@@ -1,5 +1,5 @@
 func isPangram*(s: string): bool =
-  var seen: array[26, bool] # Faster than array['a'..'z', bool] or set['a'..'z']
+  var seen: array[26, bool] # Faster than array['a'..'z', bool] or set['a'..'z'].
   var count = 0
   for c in s:
     let i = if c in {'a'..'z'}: c.ord - 'a'.ord else: c.ord - 'A'.ord

diff --git a/exercises/practice/sieve/.meta/example.nim b/exercises/practice/sieve/.meta/example.nim
@@ -7,9 +7,9 @@ func eratosthenes(n: int): seq[bool] =
   for odd in countup(3, n, 2):
     result[odd] = true
 
-  for i in countup(3, n.float.sqrt.int, 2): # Optimisation: stop at sqrt(n)
+  for i in countup(3, n.float.sqrt.int, 2): # Optimization: stop at sqrt(n).
     if result[i]:
-      for j in countup(i*i, n, 2*i): # Optimisation: start at i*i
+      for j in countup(i*i, n, 2*i): # Optimization: start at i*i.
         result[j] = false
 
 func primes*(limit: int, sieveLimit: static int = 1000): seq[int] =