Ya it may work , but i dont think we should try to overflow stack if we can find the solution with other good tricks as well ....
Does anyone know such tricks ... On 21 July 2011 19:44, rShetty <rajeevr...@gmail.com> wrote: > You can try recursively calling main() function and keep a count and > then find the count value just before the stack overflow condition. > Then multiply count with the size of the memory used in one recursive > call . Guys does this work ??? > > On Jul 21, 7:04 pm, Deoki Nandan <deok...@gmail.com> wrote: > > -- > > **With Regards > > Deoki Nandan Vishwakarma > > > > * > > * > > -- > 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. > > -- *Dilip Makwana* VJTI BTech Computers Engineering 2009-2013 -- 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.
