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 [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 -~----------~----~----~----~------~----~------~--~---
