Hi , I have an interesting algorithmic problem that i am trying to find the best data structure for.
Here's the problem. 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. The problem that i am trying to solve is that i am trying to find the best possible data structure to store the sets and corresponding strings the catch is that i want to use the set as some form of the keys and the strings as the data associated with that key. Any suggestions would be appreciated !! Regards, -Jay. P.S. I am not quite able to put this into perspective for a patricia/ radix trie. What do you think about this approach ? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
