Ask your own question, for FREE!
Computer Science 15 Online
OpenStudy (anonymous):

Which procedure has the less running time, either the Iterative procedure or the recursive procedure?

OpenStudy (anonymous):

is there any one who could get the answer for this?

OpenStudy (anonymous):

its iterative procedure.in the case of recursive procedure the same function calls itself and hence should be pushed into the stack.the stack operations take much time...so iterations are better compared to recursive......

OpenStudy (anonymous):

In addition to what thryloka said, iterative also tends to use less memory as everytime the function calls itself it recreates all local variables used and thus requires less creation and deletion of variables putting less stress on the processor

OpenStudy (anonymous):

More theory can be read here: http://pages.cs.wisc.edu/~vernon/cs367/notes/6.RECURSION.html

OpenStudy (anonymous):

@ALL thanks mates ..

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!