i doesn't seem possible without using stack... On Wed, Jun 20, 2012 at 10:13 PM, Navin Kumar <algorithm.i...@gmail.com>wrote:
> @Rishabh: i know using stack or recursion it can be done easily with O(n) > space. I want to know whether there exist more space efficient algo for > this problem or not? > > > On Wed, Jun 20, 2012 at 9:20 PM, Rishabh Agarwal <rishabh...@gmail.com>wrote: > >> @Navin: as you say "you have to take stack or some other data structure" >> then it will definately not be donw in O(1) space complexity i think the >> recursive solution is best because we are not explicitly using any extra >> space its internal stack is using this space. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/oKM6PICuD6oJ. >> >> 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. >> > > -- > 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. > -- Thanks & Regards Amritpal singh -- 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.
