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-03 14:31:11 +00:00
parent 8bd2067393
commit bb34d5d215
1 changed files with 18 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
maths/prime_factorization_fast.py
View File

@ -1,20 +1,21 @@
from math import ceil , sqrt
from math import ceil, sqrt
from __future__ import annotations
def primeproduct(n : int, x : list = []):
'''
def primeproduct(n: int, x: list = []):
"""
>>> primeproduct(868)
[2, 2, 7, 31]
>>> primeproduct(9039423423423743)
[2, 2, 7, 31, 719, 12572216166097]
>>> primeproduct(0.02)
[]
'''
"""
if n < 1:
return []
if n > 1:
if len(x)>=1 and x[-1] % n == 0: # check in already factorised
if len(x) >= 1 and x[-1] % n == 0: # check in already factorised
x.append(x[-1])
n = n // x[-1]
@ -23,22 +24,21 @@ def primeproduct(n : int, x : list = []):
flag = 0
if x != []:
for i in range(x[-1] , sq+1, 2):
for i in range(x[-1], sq + 1, 2):
if n % i == 0:
n = n // i
x.append(i)
flag = 1
break
else:
# Handle factor 2 separately
while n % 2 ==0: # only 2 is even prime
while n % 2 == 0: # only 2 is even prime
n = n // 2
x.append(2)
# Start loop from 3 and increment by 2
for i in range(3 , sq+1, 2): # skip even numbers
for i in range(3, sq + 1, 2): # skip even numbers
if n % i == 0:
n = n // i
x.append(i)
@ -49,10 +49,11 @@ def primeproduct(n : int, x : list = []):
x.append(n)
n = 1
return primeproduct(n,x)
return primeproduct(n, x)
return x
# faster than https://github.com/sourabhkv/Python/blob/master/maths/prime_factors.py approx 2x
if __name__ == "__main__":
import doctest