mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-08-06 17:46:54 +00:00
parent c18681669a
commit 0f193400e1
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
maths/prime_factorization_fast.py
View File

@ -2,6 +2,7 @@ from __future__ import annotations
from math import ceil, sqrt from math import ceil, sqrt
import time import time
def timer(func): def timer(func):
def wrapper(*args, **kwargs): def wrapper(*args, **kwargs):
start = time.time() start = time.time()
@ -10,8 +11,10 @@ def timer(func):
end = time.time() end = time.time()
print(f"{func.__name__} took {end - start:.6f} seconds to execute.") print(f"{func.__name__} took {end - start:.6f} seconds to execute.")
return result return result
return wrapper return wrapper
@timer @timer
def prime_factors(n: int) -> list[int]: def prime_factors(n: int) -> list[int]:
""" """
@ -60,6 +63,7 @@ def prime_factors(n: int) -> list[int]:
factors.append(n) factors.append(n)
return factors return factors
@timer @timer
def primeproduct(num: int) -> list[int]: def primeproduct(num: int) -> list[int]:
""" """
@ -110,7 +114,8 @@ def primeproduct(num: int) -> list[int]:
break break
return prime_factors return prime_factors
if __name__ == "__main__": if __name__ == "__main__":
n = int(input('enter number: ').strip()) n = int(input("enter number: ").strip())
primeproduct(n) primeproduct(n)
prime_factors(n) prime_factors(n)