Fester sluczak
marcinjackowiak
/ Java Big O Complexity Cheatsheet
Last active
February 6, 2026 18:11
— forked from iSergius/Java Collections Complexity cheatsheet
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Big O complexities for common methods of Java Collections and common sorting algorithms. | |
| Complexity (Best to Worst) | |
| =================================================================================================== | |
| O(1) < O(log n) < O(n) < O(n log n) < O(n^2) < O(2^n) < O(n!) | |
| Collections | |
| =================================================================================================== |