Opening the reading…

Euclid's recursive step keeps the GCD unchanged — drill-1 — LearnYard

03 Dsa FundamentalsRecursion BasicsFind the GCD of Two Numbers using Recursion

Lesson · no judge

1 of 4 parts done

1/4

DSA FUNDAMENTALS › RECURSION BASICS

Write it, run it, read the output

Reading · 6 minQuiz · 5 questions2 code drills · run only

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Implement the recursive GCD function for the running example. It must follow gcd(48, 18) -> gcd(18, 12) -> gcd(12, 6) -> gcd(6, 0) and print 6.

C++

Loading editor…

OUTPUT

Sample

What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.

Previous · Find the Sum of Digits of a Number using Recursion3 parts left before this item is marked done.Next part · Code drill 2

AI TUTORTalk to tutor

Scoped to Find the GCD of Two Numbers using Recursion. The tutor can see the reading, its checkpoints and your drill code.

The tutor reads this lesson alongside you and answers questions about it — nudging you towards the answer rather than handing it over.

Sign in to use the tutor

The tutor will not answer a quiz question for you, and it will not paste a working drill. It explains the reading it can see.