mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
d23e709aea
* maths/sum_of_digits.py: Streamline benchmarks
```
sum_of_digits(262144): 19 -- 0.3128329170285724 seconds
sum_of_digits_recursion(262144): 19 -- 0.34008108399575576 seconds
sum_of_digits_compact(262144): 19 -- 0.6086010000435635 seconds
sum_of_digits(1125899906842624): 76 -- 0.8079068749793805 seconds
sum_of_digits_recursion(1125899906842624): 76 -- 0.8435653329943307 seconds
sum_of_digits_compact(1125899906842624): 76 -- 1.247976207989268 seconds
sum_of_digits(1267650600228229401496703205376): 115 -- 1.6441589999594726 seconds
sum_of_digits_recursion(1267650600228229401496703205376): 115 -- 1.713684624992311 seconds
sum_of_digits_compact(1267650600228229401496703205376): 115 -- 2.2197747920290567 seconds
```
* updating DIRECTORY.md
* Update sum_of_digits.py
* Update sum_of_digits.py
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
75 lines
1.7 KiB
Python
75 lines
1.7 KiB
Python
def sum_of_digits(n: int) -> int:
|
|
"""
|
|
Find the sum of digits of a number.
|
|
>>> sum_of_digits(12345)
|
|
15
|
|
>>> sum_of_digits(123)
|
|
6
|
|
>>> sum_of_digits(-123)
|
|
6
|
|
>>> sum_of_digits(0)
|
|
0
|
|
"""
|
|
n = abs(n)
|
|
res = 0
|
|
while n > 0:
|
|
res += n % 10
|
|
n //= 10
|
|
return res
|
|
|
|
|
|
def sum_of_digits_recursion(n: int) -> int:
|
|
"""
|
|
Find the sum of digits of a number using recursion
|
|
>>> sum_of_digits_recursion(12345)
|
|
15
|
|
>>> sum_of_digits_recursion(123)
|
|
6
|
|
>>> sum_of_digits_recursion(-123)
|
|
6
|
|
>>> sum_of_digits_recursion(0)
|
|
0
|
|
"""
|
|
n = abs(n)
|
|
return n if n < 10 else n % 10 + sum_of_digits(n // 10)
|
|
|
|
|
|
def sum_of_digits_compact(n: int) -> int:
|
|
"""
|
|
Find the sum of digits of a number
|
|
>>> sum_of_digits_compact(12345)
|
|
15
|
|
>>> sum_of_digits_compact(123)
|
|
6
|
|
>>> sum_of_digits_compact(-123)
|
|
6
|
|
>>> sum_of_digits_compact(0)
|
|
0
|
|
"""
|
|
return sum(int(c) for c in str(abs(n)))
|
|
|
|
|
|
def benchmark() -> None:
|
|
"""
|
|
Benchmark multiple functions, with three different length int values.
|
|
"""
|
|
from collections.abc import Callable
|
|
from timeit import timeit
|
|
|
|
def benchmark_a_function(func: Callable, value: int) -> None:
|
|
call = f"{func.__name__}({value})"
|
|
timing = timeit(f"__main__.{call}", setup="import __main__")
|
|
print(f"{call:56} = {func(value)} -- {timing:.4f} seconds")
|
|
|
|
for value in (262144, 1125899906842624, 1267650600228229401496703205376):
|
|
for func in (sum_of_digits, sum_of_digits_recursion, sum_of_digits_compact):
|
|
benchmark_a_function(func, value)
|
|
print()
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
benchmark()
|