use skip list:) On Thu, Mar 10, 2011 at 2:31 PM, ravi teja <ravitejal...@gmail.com> wrote:
> @Utkarsh : > > Yeah , that is when you can access any element in O(1) time and the > elements are sorted.This happens in a sorted array where you get an overall > complexisty of O(logn). > > -- > 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.
