Talk:Hash array mapped trie
Add topicLatest comment: 1 year ago by AmirOnWiki in topic Performance?
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
| |||||||||||||||||||||
What Is An Array Mapped Trie?
[edit]The word "trie" has been linked to the article of the same name. However there's no information there or anywhere on Wikipedia as to what an array mapped trie is. This makes the introduction of limited use in my opinion.
refined version of a hash tree?
[edit]It is unclear in what way a HAMT is a refined version of a hash tree. AFAICT, no refinements over hash trees are mentioned. --MarSch (talk) 14:05, 15 March 2016 (UTC)
Performance?
[edit]The "advantages" section hints at the structure having a good performance, but no performance figures (preferably as asymptotic complexity) are given. AmirOnWiki (talk) 14:23, 20 June 2025 (UTC)