Q51
NAT2 marksConsider the recursive functions represented by the following code segment: int bar(int n) { if (n == 1) return 0; else return 1 + bar(n/2); } int foo(int n) { if (n == 1) return 1; else return 1 + foo(bar(n)); } The smallest positive integer n for which returns is . (answer in integer) Note: Ignore syntax errors (if any) in the function.
Sign in to save attempts.
Loading…