Interested to Buy Any Domain ? << Click Here >> for more details...
Can inline functions have a recursion? Give the reason?
- 3 Answers
- 9331 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / guest
Calling the by itself, then the function is no longer
called as Inline. Compiler never know how depth of the
recursion at compilation time. Therefore inline functions
cant have a recursion
| Is This Answer Correct ? | 14 Yes | 2 No |
Answer / sandeep mannarakkal
Inline is a request to the compiler , i.e it may get rejected for the following reasons,
1) If there is recursion (recursion have stack over stack, but inline don't have stack)
2) If static variable is available inside inline function
3) if function definition and implementation are available at different files
4) If there is a function pointer to inline function
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / siva
I have tested The answer is....
Yes, you can use but Not preferable.
Inline functions are expanded as macros at compile time.
Generally inline is used if the function has fewer lines of
code.
| Is This Answer Correct ? | 6 Yes | 9 No |
What is the use of endl?
What is the meaning of c++?
what is the behaviour of C and C++ compiler for the below statements. int *p; p = malloc(100); Is the behaviour same ? or different ?
What are the two main components of c++?
What is scope operator in c++?
1. What does the following do: void afunction(int *x) { x=new int; *x=12; } int main() { int v=10; afunction(&v); cout<<v; } a) Outputs 12 b) Outputs 10 c) Outputs the address of v
What is 'Copy Constructor' and when it is called?
What is DlgProc?
What will happen if a pointer is deleted twice?
How is static data member similar to a global variable?
A prime number is a number which is divisible only by itself and 1. Examples of the first few primes are 2, 3, 5, 7, 11. Consider writing a program which can generate prime numbers for you. Your program should read in and set a maximum prime to generate and a minimum number to start with when looking for primes. This program should be able to perform the following tasks: 1. Read the maximum number from user (keyboard input) to look for primes. The program should not return any primes greater than this number. 2. Read the minimum number from user (keyboard input) to look for primes. The program should not return any primes less than this number. 3. Generate and print out every prime number between the maximum prime and minimum number specified by the user.
What is the advantage of c++ over c?
STL 
