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

Update prime_factorization_fast.py

Browse Source
This commit is contained in:
Sourabh kumar verma 2023-08-06 21:09:03 +05:30 committed by GitHub
parent 2a37bbf8c5
commit 88d939422d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
maths/prime_factorization_fast.py
View File

@ -18,8 +18,7 @@ def primeproduct(num: int) -> list[int]:
if num <= 1:
return []
prime_factors = []
prime_factors: list[int] = []
while num > 1:
if len(prime_factors) >= 1 and prime_factors[-1] % num == 0:
prime_factors.append(prime_factors[-1])
@ -56,7 +55,6 @@ def primeproduct(num: int) -> list[int]:
return prime_factors
# faster than https://github.com/sourabhkv/Python/blob/master/maths/prime_factors.py approx 2x
if __name__ == "__main__":
import doctest