4 ms·
Big O complexity is an upper bound. If something is O(1) it's also O(n) and O(n!), since it's an upper bound.
by dietbacon 10y ago
Big O complexity is an upper bound.
If something is O(1) it's also O(n) and O(n!), since it's an upper bound.
loading thread…