Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Math & Number Theory
Question
Easy
tcs-nqt
Which algorithm is used to find GCD efficiently?
A
Sieve of Eratosthenes
B
Euclidean Algorithm
C
Kadane's Algorithm
D
Floyd's Algorithm
Show Answer
← Back to Math & Number Theory questions
Which algorithm is used to find GCD efficiently? | Math & Number Theory MCQ | TomoLink | TomoLink
