You can have constant access time if you store for each data point the corresponding string. Memory used = Num of data points. Or you can have log (Number of Data sets) access time using BST. Memory used = Num of data sets.
2009/8/29 Jayram Déshpandé <jayde...@gmail.com>: > Hi Guys, > > I have data sets as follows > > 1 thr' 6 correspond to string "apple" > 7 thr' 8 correspond to string "banana" > 9 thr' 25 correspond to string "mango" > and so on ... each data set has non equal number of data points (i.e. > in the first set there are 1 thr' 6 (inclusive) i.e. 6 data points) in > second set i have 7 and 8 i.e. 2 data points. I konw the beginner and > the ending data point to calculate the size of a data set. > > > problem : storing these sets with lowest time complexity for the accessing. > > precondition : using sets as the keys and strings as the data > > > any approaches ? patricia/radix ? > > what do you think ? > > Regards, > -Jay. > > > -- > "Subvert the paradigm." - C.K. Prahlad > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
