mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 18:38: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-22 00:13:19 +05:30 committed by GitHub
parent b64348256f
commit 896f6bebb0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
maths/prime_factorization_fast.py
View File

@ -49,6 +49,9 @@ def prime_factors(num: int) -> list[int]:
def primeproduct(num: int) -> list[int]: def primeproduct(num: int) -> list[int]:
""" """
Returns prime factors of a positive integer num as a list. Returns prime factors of a positive integer num as a list.
2 is only even prime so special while loop to handle it.
Skipping other even numbers.
Taking root n approach for getting prime number.
>>> primeproduct(868) >>> primeproduct(868)
[2, 2, 7, 31] [2, 2, 7, 31]