How massa7ca/fast_factorial works
This repository is a collection of standalone factorial and smallest-multiple programs, not a shared application. Each implementation generates values and multiplies them using GMP-backed big integers; some variants parallelize the multiplication. The README documents GMP and a factorial compile/run example, but no shared runtime or links between implementations are shown. All substantial source files are represented; the relationships below show only GMP usage visible in the excerpts, not a common pipeline.
Main entry points: factorial.cpp Factorial C++ · factorial_V2.cpp Factorial C++ V2 · factorial_V3.cpp Factorial C++ V3 · factorial_method_Tree.cpp Factorial product tree
Components 10
Factorial programs
- Factorial C++
factorial.cpp - Factorial C++ V2
factorial_V2.cpp - Factorial C++ V3
factorial_V3.cpp - Factorial Python
factorial.py - Factorial product tree
factorial_method_Tree.cpp
Smallest-multiple programs
- Smallest multiple C++
SmallestMultiple.cpp - Smallest multiple C++ V2
SmallestMultiple_V2.cpp - Smallest multiple C++ V3
SmallestMultiple_V3.cpp - Smallest multiple Python
SmallestMultiple.py
Other components
- GMP big integers
Connections 8
- Factorial C++ → GMP big integers: multiplies with
factorial.cpp - Factorial C++ V2 → GMP big integers: multiplies with
factorial_V2.cpp - Factorial C++ V3 → GMP big integers: multiplies with
factorial_V3.cpp - Factorial product tree → GMP big integers: multiplies with
factorial_method_Tree.cpp - Smallest multiple C++ → GMP big integers: multiplies with
SmallestMultiple.cpp - Smallest multiple C++ V2 → GMP big integers: multiplies with
SmallestMultiple_V2.cpp - Smallest multiple C++ V3 → GMP big integers: multiplies with
SmallestMultiple_V3.cpp - Smallest multiple Python → GMP big integers: uses mpz
SmallestMultiple.py