- C Recursion 1 (29.72 KiB) Viewed 10 times
C. RECURSION
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
C. RECURSION
C. RECURSION
FE-RECURSION If a = 3, how many times will the recursive function be called? 1 #include 2 3 void mystery (int x) 4E ( 5 6 10 73 7E { 8 9 10 11 288 WNHO 12 18 음의 13 14 15 int main() 16 { 17 19 20 21 } 15 O int temp; if (x > 0) 12 O 14 O Answer not among the choices. temp = x 1; mystery (temp); printf("%d\t", x); mystery (temp); 13 int a; scanf("%d", &a); mystery(a); return 0;
FE-RECURSION If a = 3, how many times will the recursive function be called? 1 #include 2 3 void mystery (int x) 4E ( 5 6 10 73 7E { 8 9 10 11 288 WNHO 12 18 음의 13 14 15 int main() 16 { 17 19 20 21 } 15 O int temp; if (x > 0) 12 O 14 O Answer not among the choices. temp = x 1; mystery (temp); printf("%d\t", x); mystery (temp); 13 int a; scanf("%d", &a); mystery(a); return 0;