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
Implement largest(int[] a, int n) recursively without loops or shared state. Call it for [4, 2, 7, 1] with n = 4 and print the returned largest value.
OUTPUT
Sample7
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.