Interested to Buy Any Domain ? << Click Here >> for more details...
which is faster execution: loops or recursion?
- 3 Answers
- 7125 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nipa
loop is faster then recursion. because in recursion several
time function call itself, so it take time to pass control
to function and return value, but in loop control not pass
in other function it work in same function.here we consider
that function and loop contain same number of statement.
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / sight
It's not necessary that every time faster loops only because
it's depends upon the problem.....
On this we take decision that it's faster working with loop
or recursion....
| Is This Answer Correct ? | 6 Yes | 4 No |
An application package has been provided to you without any documents for the following application. The application needs to be tested. How will you proceed?
how to implement stack work as a queue?
What is #include stdlib h?
2. Write a function called hms_to_secs() that takes three int values—for hours, minutes, and seconds—as arguments, and returns the equivalent time in seconds.. Create a program that exercises this function by repeatedly obtaining a time value in hours, minutes, and seconds from the user (format 12:59:59), calling the function, and displaying the value of seconds it returns.
What are the two types of functions in c?
What is wrong with this code?
What is table lookup in c?
What is a structure member in c?
Heyyy All, Just a challenge . A C program with if Else if(){ /// insert sumthing print ("in if") // insert sumting } else { ///// insert sumthing print ("in else"); //// insert sumthing } can anyone modify it so that program prints. if and else both
What is new line escape sequence?
How do I use strcmp?
What are the advantages of using new operator as compared to the function malloc ()?
C 
