- Implemented a classical simulation of Shor’s Algorithm in `algorithms/cryptography/shor_algorithm.py`
- The algorithm factors a composite number N without using quantum computing libraries
- Uses modular exponentiation and order-finding to determine factors
- Includes an example usage for testing
