aboutsummaryrefslogtreecommitdiff
path: root/src/content/chapter0_basics/lesson17_lists/en.html
diff options
context:
space:
mode:
authorLars Kappert <lars@webpro.nl>2024-04-26 15:19:15 +0200
committerLouis Pilfold <louis@lpil.uk>2024-05-03 11:18:07 +0100
commit80a340e4649bff9aff4466fbd61a076a04624e4c (patch)
tree6af32df2541ca9913a8f46c5e24694aac8aec19d /src/content/chapter0_basics/lesson17_lists/en.html
parentb8011ddb3597351883236c74c0e1739b50a3e25e (diff)
downloadtour-80a340e4649bff9aff4466fbd61a076a04624e4c.tar.gz
tour-80a340e4649bff9aff4466fbd61a076a04624e4c.zip
Increase consistency and readability a tiny bit
Diffstat (limited to 'src/content/chapter0_basics/lesson17_lists/en.html')
-rw-r--r--src/content/chapter0_basics/lesson17_lists/en.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/content/chapter0_basics/lesson17_lists/en.html b/src/content/chapter0_basics/lesson17_lists/en.html
index 84f88f3..5db7c11 100644
--- a/src/content/chapter0_basics/lesson17_lists/en.html
+++ b/src/content/chapter0_basics/lesson17_lists/en.html
@@ -15,7 +15,7 @@
</p>
<p>
Counting the length of a list or getting elements from other positions in the
- list is expensive and rarely done. It is rare to write algorithms that index
+ list is expensive and rarely done. It's rare to write algorithms that index
into sequences in Gleam, but when they are written a list is not the right
choice of data structure.
</p>