From d1d334eb13231f538c2d9a18dc691af3e53221b9 Mon Sep 17 00:00:00 2001 From: KarelVerschraegen Date: Tue, 28 May 2024 10:39:23 +0200 Subject: [PATCH] Update programming.md --- docs/programming.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/programming.md b/docs/programming.md index 14066998..d09aab58 100644 --- a/docs/programming.md +++ b/docs/programming.md @@ -200,7 +200,7 @@ Note that it is actually possible to write a recursive function using purely ano ### Tail call optimization (Tail recursion) -A recursive function adds a new frame to the call stack each time it invokes itself. This can eventually lead to stack exhaustion if the function recuses beyond a certain limit. Consider the classic recursive implementation of the factorial function +A recursive function adds a new frame to the call stack each time it invokes itself. This can eventually lead to stack exhaustion if the function recurses beyond a certain limit. Consider the classic recursive implementation of the factorial function ``` (