On Monday, March 5, 2012 5:33:46 PM UTC-5, Sehaj wrote: > > ... I was asked this question during an interview, so I think there > must/might be some possible solution. >
Ha. I wouldn't draw that conclusion. They are fishing for what you know. Theoretical limits are good to know. So are creative solutions and non-standard techniques. I might have suggested a fixed size data structure, with capacity something more than the maximum number of items that would ever need to be stored. All operations would then iterate over the entire data container, empty space and all, and always run in constant time. -- 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/-/AHBDkryu9fwJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
