Replies
Welcome, guest
Join CrazyEngineers to reply, ask questions, and participate in conversations.
CrazyEngineers powered by Jatra Community Platform
-
@morningdot-6Xuj4M • Oct 13, 2010
Well i have some good point about this question.
function will create a stack memory place in the ram while it is implemented.while procedure doesn't.
In the case of recursive function you gonne create stack for every function call.That is why recursive function is slower than our looping concept.
Function implementation is an easy approach then our older procedural programming approach.