Timeline for Making ArrayList.containsAll run faster
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2015 at 17:05 | vote | accept | coderodde | ||
| Jul 5, 2015 at 11:41 | answer | added | maaartinus | timeline score: 4 | |
| Jul 5, 2015 at 10:42 | comment | added | user140547 | I think when you test algorithms with different complexity O(mn) vs O(n) vs O(m), it usually still gives meaningful results as the performance difference can be an order of magnitude. | |
| Jul 5, 2015 at 10:38 | answer | added | Vogel612 | timeline score: 7 | |
| Jul 5, 2015 at 10:35 | answer | added | user140547 | timeline score: 2 | |
| Jul 5, 2015 at 10:30 | answer | added | Emily L. | timeline score: 5 | |
| Jul 5, 2015 at 10:17 | comment | added | Emily L. | Java benchmarking is tricky. You should read this before you make any conclusions based on your results: stackoverflow.com/questions/504103/… | |
| Jul 5, 2015 at 9:52 | answer | added | mjolka | timeline score: 6 | |
| Jul 5, 2015 at 9:05 | history | asked | coderodde | CC BY-SA 3.0 |