[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

algorithms/cryptography/shor_algorithm.py

@@ -1,12 +1,14 @@
 import math
 import random
 
+
 def gcd(a, b):
     """Computes the greatest common divisor using Euclidean algorithm."""
     while b:
         a, b = b, a % b
     return a
 
+
 def modular_exponentiation(base, exp, mod):
     """Computes (base^exp) % mod using fast modular exponentiation."""
     result = 1
@@ -17,7 +19,8 @@
         exp //= 2
     return result
 
+
 def find_order(a, N):
     """Finds the smallest r such that a^r ≡ 1 (mod N)"""
     r = 1
     while modular_exponentiation(a, r, N) != 1:
@@ -26,8 +29,9 @@
             return None
     return r
 
+
 def shor_algorithm(N):
     """Simulates Shor’s Algorithm classically to factorize N."""
     if N % 2 == 0:
         return 2, N // 2  # Trivial case if N is even
 
@@ -49,6 +53,7 @@
         if 1 < factor2 < N:
             return factor2, N // factor2
 
+
 # Example usage
 if __name__ == "__main__":
     N = 15  # You can test with 21, 35, 55, etc.