1. True and True, though the second depends somewhat on features supported by the language you are using. Languages like ML (or OCAML) and Scheme are designed to support this.
2. You need somewhere to store state (lambda parameters at the lowest level). The stack is one mechanism. There are others. Continuations are an example. They're normally implemented on a garbage-collected heap. On Sep 9, 9:38 pm, ravi maggon <maggonr...@gmail.com> wrote: > 1. can recursive func be converted to iterative func always > Yes/No > is vice versa True/False > if False give the example. > > 2. can recursion be done without stack when converted to iterative sort of > thing or we need to implement our own stack? > > -- > > Regards > Ravi Maggon > Final Year, B.E. CSE > Thapar University -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
