From 4efb34bd728732101432843ed0bfbeb971272287 Mon Sep 17 00:00:00 2001
From: Louis Pilfold <louis@lpil.uk>
Date: Thu, 21 Dec 2023 14:03:41 +0000
Subject: Add chapters

---
 lessons/src/lesson026_list_recursion/text.html | 22 ----------------------
 1 file changed, 22 deletions(-)
 delete mode 100644 lessons/src/lesson026_list_recursion/text.html

(limited to 'lessons/src/lesson026_list_recursion/text.html')

diff --git a/lessons/src/lesson026_list_recursion/text.html b/lessons/src/lesson026_list_recursion/text.html
deleted file mode 100644
index 7f2351d..0000000
--- a/lessons/src/lesson026_list_recursion/text.html
+++ /dev/null
@@ -1,22 +0,0 @@
-<p>
-  Most commonly functions in the 
-  <a href="https://hexdocs.pm/gleam_stdlib/gleam/list.html"><code>gleam/list</code></a>
-  module are used to iterate across a list, but at times you may prefer
-  to work with the list directly.
-</p>
-<p>
-  Gleam doesn't have a looping syntax, instead iteration is done through
-  recursion and pattern matching.
-</p> 
-<p>
-  The <code>[first, ..rest]</code> pattern matches on a list with at least one
-  element, assigning the first element to the variable <code>first</code> and
-  the rest of the list to the variable <code>rest</code>.
-  By using this pattern and a pattern for the empty list <code>[]</code> a
-  function can run code on each element of a list until the end is reached.
-</p>
-<p>
-  This code sums a list by recursing over the list and adding each int to a
-  <code>total</code> argument, returning it when the end is reached.
-</p>
-
-- 
cgit v1.2.3