fix(maths): correct recursive call in sum_of_digits_recursion

fauzan171 · fauzan171 · commit 03158a9664f8 · 2026-06-07T00:00:10.000+07:00
sum_of_digits_recursion() was calling sum_of_digits() (the iterative version) instead of itself in the recursive case. This meant the function was not actually recursive as its name suggests.
diff --git a/maths/sum_of_digits.py b/maths/sum_of_digits.py
@@ -31,7 +31,7 @@ def sum_of_digits_recursion(n: int) -> int:
     0
     """
     n = abs(n)
-    return n if n < 10 else n % 10 + sum_of_digits(n // 10)
+    return n if n < 10 else n % 10 + sum_of_digits_recursion(n // 10)
 
 
 def sum_of_digits_compact(n: int) -> int:

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,7 @@ def sum_of_digits_recursion(n: int) -> int:`
`31`	`31`	`0`
`32`	`32`	`"""`
`33`	`33`	`n = abs(n)`
`34`		`- return n if n < 10 else n % 10 + sum_of_digits(n // 10)`
	`34`	`+ return n if n < 10 else n % 10 + sum_of_digits_recursion(n // 10)`
`35`	`35`
`36`	`36`
`37`	`37`	`def sum_of_digits_compact(n: int) -> int:`