wont recursion will also be resource (time) intensive because of the multiple function call which is not observed in iterative procedures.
On Tue, Jun 14, 2011 at 7:30 AM, Navneet Gupta <[email protected]>wrote: > Recursion is the best way to write compact programs for what might > seem as tedious tasks to do. > > Dynamic Programming is an alternate to recursion when problems possess > characteristics like suboptimal substructures and overlapping > subproblems. > > Dynamic Programming is a iterative way of doing tasks which can also > be done with recursion but they are generally less time intensive. > > Recursion is space intensive because it takes space for storing > activation blocks of recursive function calls > > > On Tue, Jun 14, 2011 at 2:18 AM, Supraja Jayakumar > <[email protected]> wrote: > > Is it right to say iteration is resource(time) intensive and recursion is > > not. On > > the other hand, recursion is space intensive (with stacks) and iteration > is > > not ? > > Thanks > > On Mon, Jun 13, 2011 at 2:08 PM, ADITYA KUMAR <[email protected]> > wrote: > >> > >> its always better to have iterative program than recursive > >> since iterative program doesn't rely on system stack.. > >> but recursive program are easy to write and gives a clear view of > program > >> > >> On Tue, Jun 14, 2011 at 1:13 AM, snehi jain <[email protected]> > wrote: > >>> > >>> hi, > >>> we try to implement many programs using Recursion > >>> and its said that this is better than iterative procedure. > >>> if i am right then > >>> i cant understand why is it so? > >>> can anybody explain ... > >>> and are there situations when iterative procedure is better than > >>> recursion. > >>> > >>> Snehi > >>> > >>> -- > >>> You received this message because you are subscribed to the Google > Groups > >>> "Algorithm Geeks" group. > >>> To post to this group, send email to [email protected]. > >>> To unsubscribe from this group, send email to > >>> [email protected]. > >>> For more options, visit this group at > >>> http://groups.google.com/group/algogeeks?hl=en. > >> > >> > >> > >> -- > >> Regards > >> Aditya Kumar > >> B-tech 3rd year > >> Computer Science & Engg. > >> MNNIT, Allahabad. > >> > >> -- > >> You received this message because you are subscribed to the Google > Groups > >> "Algorithm Geeks" group. > >> To post to this group, send email to [email protected]. > >> To unsubscribe from this group, send email to > >> [email protected]. > >> For more options, visit this group at > >> http://groups.google.com/group/algogeeks?hl=en. > > > > > > > > -- > > U > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > > http://groups.google.com/group/algogeeks?hl=en. > > > > > > -- > --Navneet > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
