GCD (Greatest Common Divisor) of Two Numbers
6 views
1 min read
GCD (Greatest Common Divisor) of Two Numbers :-
Question
Write an algorithm and flowchart to find the GCD (Greatest Common Divisor) of two numbers.
दो संख्याओं का GCD (Greatest Common Divisor / महत्तम समापवर्तक) ज्ञात करने के लिए एक Algorithm और Flowchart लिखिए।
ExampleInput: A = 24, B = 36
GCD: 12
- Start.
- Input two numbers A and B.
- If B ≠ 0, set TEMP = A % B.
- Set A = B.
- Set B = TEMP.
- Repeat Steps 3 to 5 while B ≠ 0.
- Display A as the GCD.
- Stop.
TEMP = A % B
A = B
B = TEMP
Repeat until B = 0.
When B becomes 0, the value of A is the GCD.
Flowchart :-
