From ab2b9a982ede817362072623ff9ae2aa42e083da Mon Sep 17 00:00:00 2001
From: Louis Pilfold <louis@lpil.uk>
Date: Thu, 18 Jan 2024 20:34:43 +0000
Subject: Move recursion lessons together

---
 .../lesson02_tail_calls/text.html                  | 23 ----------------------
 1 file changed, 23 deletions(-)
 delete mode 100644 src/content/chapter1_functions/lesson02_tail_calls/text.html

(limited to 'src/content/chapter1_functions/lesson02_tail_calls/text.html')

diff --git a/src/content/chapter1_functions/lesson02_tail_calls/text.html b/src/content/chapter1_functions/lesson02_tail_calls/text.html
deleted file mode 100644
index ec39cda..0000000
--- a/src/content/chapter1_functions/lesson02_tail_calls/text.html
+++ /dev/null
@@ -1,23 +0,0 @@
-<p>
-  When a function is called a new stack frame is created in memory to store the
-  arguments and local variables of the function. If lots of these frames are
-  created during recursion then the program would use a large amount of memory,
-  or even crash the program if some limit is hit.
-</p>
-<p>
-  To avoid this problem Gleam supports <em>tail call optimisation</em>, which
-  allows the compiler to reuse the stack frame for the current function if a
-  function call is the last thing the function does, removing the memory cost.
-</p>
-
-<p>
-  Unoptimised recursive functions can often be rewritten into tail call
-  optimised functions by using an accumulator. An accumulator is a variable that
-  is passed along in addition to the data, similar to a mutable variable in a
-  language with <code>while</code> loops.
-</p>
-<p>
-  Accumulators should be hidden away from the users of your code, they are
-  internal implementation details. To do this write a public function that calls
-  a recursive private function with the initial accumulator value.
-</p>
-- 
cgit v1.2.3