Java Collections Framework 实现的 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 的:

This website is pretty good but not specific to Java: http://bigocheatsheet.com/

这篇关于Java Collections Framework 实现的 Big-O 摘要?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！