docs: update comments

Author: codejsha

python-algorithm/algorithm/dp/fibonacci.py

@@ -63,7 +63,7 @@ def fibonacci_generator(n: int) -> Generator[int, None, None]:
     """
     Calculate the Fibonacci number of the given number using generator approach.
     :param n: input number
-    :return: Fibonacci number
+    :return: generator of Fibonacci numbers
     """
     yield 0  # special case
     if n > 0:

python-algorithm/algorithm/math/greatest_common_divisor.py

@@ -1,7 +1,7 @@
 def gcd_euclidean(a: int, b: int) -> int:
     """
     Find the greatest common divisor of two numbers using the Euclidean algorithm.
-    :param a: number
+    :param a: dividend
     :param b: divisor
     :return: the greatest common divisor
     """
@@ -14,7 +14,7 @@ def gcd_euclidean_divmod(a: int, b: int) -> int:
     """
     Find the greatest common divisor of two numbers using the Euclidean algorithm.
     If the numbers are large, use divmod to calculate them.
-    :param a: number
+    :param a: dividend
     :param b: divisor
     :return: the greatest common divisor
     """
@@ -26,7 +26,7 @@ def gcd_euclidean_divmod(a: int, b: int) -> int:
 def gcd_extended_euclidean(a: int, b: int) -> tuple:
     """
     Find the greatest common divisor of two numbers using the extended Euclidean algorithm.
-    :param a: number
+    :param a: dividend
     :param b: divisor
     :return: the greatest common divisor, x, y (where ax + by = gcd(a, b))
     """