Question: Why is this not an algorithm? Other methods for gcd(m,n) (cont.) Middle-school procedure - Step 1 Find the prime factorization of a Step 2 Find
Other methods for gcd(m,n) (cont.) Middle-school procedure - Step 1 Find the prime factorization of a Step 2 Find the prime factorization of Step 3 Find all the common prime l'actors Step 4 Compute the product of all the common prime factors and return it as ged(m,n) Is this an algorithm? Bad Oh 1012
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
