Usually recursion works slower than loops. – McqOptions

MCQOPTIONS

1.	Usually recursion works slower than loops.
A.	Yes
B.	No
C.	Yes
D.	No
Answer» B. No

Discussion

No Comment Found

Related MCQs

In C all functions except can be called recursively.
If is 2 bytes wide.What will be the output of the program?
If a function contains two statements successively, the compiler will generate warnings. Yes/No ?
Will the following functions work?
In a function two statements should never occur.
What will be the output of the following C code?#include <stdio.h> void fun(); int main() { void fun(); fun(); return 0; } void fun() { printf("Hello..."); }
What will be the output of the following C code?#include <stdio.h> void N() { printf("Hello..."); } void main() { N(); }
What will be the output of the following C code?#include <stdio.h> int main() { void funA(); void funB() { funA(); } funB(); } void FunA() { printf("Interview Mania"); }
What will be the output of the following C code?#include <stdio.h> void fun(); int main() { void fun(int); fun(); return 0; } void fun() { printf("200"); }
What will be the output of the following C code?#include <stdio.h> void fun(); int main() { void fun(int); fun(100); return 0; } void fun(int n) { printf("200 "); }