stack is the best option, isnt it ? O(1) for both operations. On Thu, Jun 30, 2011 at 9:55 PM, Jitendra singh <jsinghrath...@gmail.com>wrote:
> circular linklist containing three pointers start,end,current > > On 6/27/11, vaibhav agarwal <vibhu.bitspil...@gmail.com> wrote: > > @radha k but i think we need to store the bottom of the stack for > deleting > > the last node in O(1). > > as we can click the redo or undo fixed number of times > > and we would need two stacks > > is that ok. > > > > On Mon, Jun 27, 2011 at 10:31 PM, radha krishnan < > > radhakrishnance...@gmail.com> wrote: > > > >> You asked the Most Efficient dude > >> > >> On Mon, Jun 27, 2011 at 10:29 PM, vaibhav agarwal > >> <vibhu.bitspil...@gmail.com> wrote: > >> > @radha: hw abt using a fixed size circular list? > >> > > >> > On Sat, Jun 25, 2011 at 8:25 PM, radha krishnan > >> > <radhakrishnance...@gmail.com> wrote: > >> >> > >> >> simple!! > >> >> Stack:P > >> >> > >> >> On Sat, Jun 25, 2011 at 8:11 PM, rShetty <rajeevr...@gmail.com> > wrote: > >> >> > Suggest the most efficient Data Structures and algorithms to > >> >> > implement > >> >> > Undo and Redo operations in any of the Office Suites ? > >> >> > > >> >> > -- > >> >> > 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. > >> >> > > >> >> > > >> >> > >> >> -- > >> >> 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. > >> >> > >> > > >> > -- > >> > 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. > >> > > >> > >> -- > >> 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. > >> > >> > > > > -- > > 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. > > > > > > -- > 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. > > -- 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.
