问题描述
任何人都可以给我一个包含主要Java数据结构摘要的网站的引用,以及它们各自的复杂性(对于某些给定的操作,如添加,查找,删除)。 Hashtable
s是O(1)用于查找,而 LinkedList
s是O(n)。一些细节,如内存使用情况也是很好的。 这对于算法的数据结构的思考非常有用。
有没有理由认为Java的实现与通用的语言无关的实现是不同的(在复杂性方面)?换句话说,为什么不引用关于各种数据结构的复杂性的一般参考:
但是,如果你坚持使用Java特定的:
(dead link,but )
Can anyone give me references of a web site containing a summary of the main Java data structures, and their respective complexity in time (for some given operations like add, find, remove), e.g. Hashtable
s are O(1) for finding, while LinkedList
s are O(n). Some details like memory usage would be nice too.
This would be really helpful for thinking in data structures for algorithms.
Is there a reason to think that Java's implementation is different (in terms of complexity) than a generic, language agnostic implementation? In other words, why not just refer to a general reference on the complexity of various data structures:
NIST Dictionary of Algorithms and Data Structures
But, if you insist on Java-specific:
Java standard data structures Big O notation
Java Collections cheatsheet V2 (dead link, but this is the first version of the cheatsheet)
这篇关于Java数据结构参考的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!