From 7b1cfea2f3c5d847e90f51ab9df00791b2f29fae Mon Sep 17 00:00:00 2001 From: Carl Date: Fri, 4 Aug 2023 22:55:40 +0200 Subject: [PATCH] Fix link --- .../collatz-conjecture/.approaches/recursion/content.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/practice/collatz-conjecture/.approaches/recursion/content.md b/exercises/practice/collatz-conjecture/.approaches/recursion/content.md index 173aef13c5..def361c895 100644 --- a/exercises/practice/collatz-conjecture/.approaches/recursion/content.md +++ b/exercises/practice/collatz-conjecture/.approaches/recursion/content.md @@ -42,7 +42,7 @@ Which means that the stack of `1 + steps(number)` will grow until it reaches the ~~~~exercism/caution In Python, we can't have a function call itself more than 1000 times by default. Code that exceeds this recursion limit will throw a [RecursionError](https://docs.python.org/3/library/exceptions.html#RecursionError). -While it is possible to adjust the [recursion limit][recursion-limit](https://docs.python.org/3/library/sys.html#sys.setrecursionlimit), doing so risks crashing Python and may also crash your system. +While it is possible to adjust the [recursion limit](https://docs.python.org/3/library/sys.html#sys.setrecursionlimit), doing so risks crashing Python and may also crash your system. Casually raising the recursion limit is not recommended. ~~~~