Java集合框架实现的Big-O总结？ [英] Big-O summary for Java Collections Framework implementations?
问题描述
我可能很快就在教授一个Java崩溃课程。虽然可能安全地假设观众成员会知道Big-O表示法，但假定他们将知道各种集合实现的各种操作的顺序是不安全的。
I may be teaching a "Java crash-course" soon. While it is probably safe to assume that the audience members will know Big-O notation, it is probably not safe to assume that they will know what the order of the various operations on various collection implementations is.
我可能需要时间自己生成一个汇总矩阵，但如果它已经在公共领域的某个地方，我一定会重用它（当然有适当的信用）。
I could take time to generate a summary matrix myself, but if it's already out there in the public domain somewhere, I'd sure like to reuse it (with proper credit, of course.)
任何人都有任何指针？
推荐答案
到Java： http://bigocheatsheet.com/
此答案中的原始链接的副本可以在 https://github.com/benblack86/java-snippets/blob/master/resources/java_collections.pdf
A copy of the original link in this answer can be found at https://github.com/benblack86/java-snippets/blob/master/resources/java_collections.pdf
<
The website hosting the original links for Java's big-O summary has gone offline. You can still find them at the web archive:
http://web.archive.org/web/20110227091351/http://www.coderfriendly.com/2009/05/12/java-collections-cheatsheet/
http://web.archive.org/web/20110626160836/http://www.coderfriendly.com/wp-content/uploads/2009/05/java_collections_v2.pdf
这篇关于Java集合框架实现的Big-O总结？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
