Miller–Rabin primality test: Examples & Code
Miller–Rabin primality test: Use deterministic bases 2 and 3 for the bounded domain n ≤ 9999. This bound is part of the contract. Explore a worked example,…
Explore algorithm visualizations code snippets and tutorials
Miller–Rabin primality test: Use deterministic bases 2 and 3 for the bounded domain n ≤ 9999. This bound is part of the contract. Explore a worked example,…
Segmented prime sieve: Sieve only a bounded interval using primes up to the square root of its upper bound. Explore a worked example, complexity and tested…
Extended Euclidean algorithm: Find gcd(a,b) and signed coefficients x,y satisfying ax + by = gcd(a,b). Explore a worked example, complexity and tested code.
Minimum palindrome partition cuts: Build palindrome intervals and minimum prefix cuts, then reconstruct a partition. Explore a worked example, complexity and…
Egg dropping (moves formulation): Track the maximum number of floors distinguishable with each egg count and number of drops. Explore a worked example,…