Opening the reading…
Opening the reading…
DSA FUNDAMENTALS › RECURSION BASICS
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Complete the recursive function so decimal 13 follows the calls 13, 6, 3, 1, and 0. Print each remainder after the recursive call so the program prints the binary representation 1101.
OUTPUT
Sample1101
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.