Question: QUESTION 1 algorithm can be used to find g c d ( a , b ) . a . euclid's b . euripides c .

QUESTION 1
algorithm can be used to find gcd(a,b).
a. euclid's
b. euripides
c. euler's
d. eratosthene's
QUESTION 2
zan be used to find prime numbers.
a. strassen's algorithm
b. sieve of erastosthenes
c. mobius inversion
d. bouchard's algorithm
QUESTION 3
A.
tries all possibilities to find the optimal solution.
a. euclid's algorithm
b. binary search
c. tower of hanoi
d. brute force algorithm
 QUESTION 1 algorithm can be used to find gcd(a,b). a. euclid's

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!