Question

Consider the recursive function:  int fact(int
n) {  if (n == 0) return 1;  return n * fact(n-1);  }  How many total function calls (including the very first, outermost call) occur when evaluating fact(5)?

A 6
B 10
C 15
D 4
E 5
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)