Making it more readable by adding necessary details!

Author: Sai-Sravya-Thumati

maths/basic_maths.py

@@ -4,6 +4,11 @@
 
 
 def prime_factors(n: int) -> list:
+    """
+    Uses a standard method of dividing by 2, then odd divisors up to sqrt(n).
+    Time Complexity: O(sqrt(n))
+    Space Complexity: O(log n) on average
+    """
     """Find Prime Factors.
     >>> prime_factors(100)
     [2, 2, 5, 5]
@@ -120,3 +125,4 @@ def euler_phi(n: int) -> int:
     import doctest
 
     doctest.testmod()
+