added bubble sort

Author: r2rahul

codes/project_euler_721.py

@@ -17,17 +17,44 @@
 #%%
 #mpm.mp.dps = 5; mpm.mp.pretty = False
 #%%
-def f(a,n):
+def f(a, n):
+    """
+    Calculates a mathematical expression involving square roots and exponents.
+
+    Args:
+    a (mpf): The base number for calculations.
+    n (int): The exponent to be applied.
+
+    Returns:
+    mpf: The floor of the result of (ceil(sqrt(a)) + sqrt(a))^n.
+
+    Note:
+    This function uses the mpmath library (mpm) for high-precision arithmetic.
+    """
     return mpm.floor(
-        mpm.fadd( mpm.ceil(mpm.sqrt(a)), mpm.sqrt(a))**n
+        mpm.fadd(mpm.ceil(mpm.sqrt(a)), mpm.sqrt(a))**n
     )
 
 def g(n):
+    """
+    Computes the sum of f(a, a^2) for a range of values.
+
+    Args:
+    n (int): The upper limit of the range (inclusive).
+
+    Returns:
+    mpf: The sum of f(a, a^2) for a from 1 to n.
+
+    Note:
+    This function uses the mpmath library (mpm) for high-precision arithmetic
+    and range generation.
+    """
     return mpm.fsum(
-        [f(a, a**2) for a in mpm.arange(1, (n+ 1))]
-               )
+        [f(a, a**2) for a in mpm.arange(1, (n + 1))]
+    )
+
 #%%
-__init__ = main():
+if __name__ == '__main__':
     print('f(5, 2) = '.format(f(5, 2)))
     print('f(5, 5) = '.format(f(5, 5)))
     print('***************************')

codes/sorting_algo.py

@@ -0,0 +1,34 @@
+def bubble_sort(my_list):
+    """
+    Sorts a list in ascending order using the bubble sort algorithm.
+
+    Args:
+    my_list (list): The input list to be sorted.
+
+    Returns:
+    list: The sorted list in ascending order.
+
+    Time complexity: O(n^2), where n is the number of elements in the list.
+    Space complexity: O(1), as sorting is done in-place.
+
+    Note:
+    - If the input list is empty, an empty list is returned.
+    - This implementation modifies the original list in-place.
+
+    Example:
+    >>> bubble_sort([64, 34, 25, 12, 22, 11, 90])
+    [11, 12, 22, 25, 34, 64, 90]
+    """
+    if not my_list:
+        return []
+    n = len(my_list)
+    for i in range(n):
+        for j in range(n - i - 1):
+            if(my_list[j] > my_list[j + 1]):
+                my_list[j], my_list[j + 1] = my_list[j + 1], my_list[j]
+    return my_list
+
+
+if __name__ == '__main__':
+    num = bubble_sort([64, 34, 25, 12, 22, 11, 90])
+    print(num)