I think b-tree would help you...
On Sat, Sep 3, 2011 at 9:47 AM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
WHY trie? any reason ?
Dictionary means not only to save efficiently and also we have to get back
in almost O(1) time .. I think Hash Table is best suited for this... Or
Hii
Which data structures can be used for implementation for dictionary?
which is best/good among them?
provide good link for that.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
trie data structure
On Fri, Sep 2, 2011 at 11:21 PM, Aman Kumar amanas...@gmail.com wrote:
Hii
Which data structures can be used for implementation for dictionary?
which is best/good among them?
provide good link for that.
--
You received this message because you are subscribed to the
trie
On Sat, Sep 3, 2011 at 12:05 AM, sukran dhawan sukrandha...@gmail.comwrote:
trie data structure
On Fri, Sep 2, 2011 at 11:21 PM, Aman Kumar amanas...@gmail.com wrote:
Hii
Which data structures can be used for implementation for dictionary?
which is best/good among them?
provide
Trie is good, but I prefer inverted index.
On Fri, Sep 2, 2011 at 1:38 PM, somya mishra somya.bvm...@gmail.com wrote:
trie
On Sat, Sep 3, 2011 at 12:05 AM, sukran dhawan sukrandha...@gmail.comwrote:
trie data structure
On Fri, Sep 2, 2011 at 11:21 PM, Aman Kumar amanas...@gmail.com
what is inverted index ?
On Sat, Sep 3, 2011 at 12:53 AM, Yuchen Liao lycdra...@gmail.com wrote:
Trie is good, but I prefer inverted index.
On Fri, Sep 2, 2011 at 1:38 PM, somya mishra somya.bvm...@gmail.comwrote:
trie
On Sat, Sep 3, 2011 at 12:05 AM, sukran dhawan
WHY trie? any reason ?
Dictionary means not only to save efficiently and also we have to get back
in almost O(1) time .. I think Hash Table is best suited for this... Or any
way we have Dictionary Data Structure in Java..
On Fri, Sep 2, 2011 at 3:23 PM, Yuchen Liao lycdra...@gmail.com wrote:
