Please enable JavaScript.
Coggle requires JavaScript to display documents.
Big O (Operações (+, -, /, *, = (assignment), ^, ++ (conta soma e…
Big O
-
-
Time complexity
Conforme n aumenta,
a função O pode ser
-
-
-
Dicas
-
-
-
In a loop, the complexity is the lenght of the loop
times the complexity of whatever happens inside the loop
Space Complexity
Dicas
Primitivos (booleans, numbers, undefined and nulls) are constants space
-
Reference types are generally O(n), where n is the length of arrays or the number of keys for objects