Não decore palavra por palavra: entenda a estrutura da resposta e refaça com as suas palavras, em inglês.
An asymptotic upper bound on how resource use grows with input size. State the input size, operation model, and whether the bound is worst-case, expected, or amortized. Big-O alone is not an exact count or necessarily a tight bound.
For work dominated by a linear term, doubling a large input roughly doubles it. A quadratic dominant term roughly quadruples. Binary search adds about one halving step when the initial search space doubles.
Under common models, array indexing is O(1), hash lookup is expected O(1), and merge sort is O(n log n). A hash table's worst case and a language's sort implementation need separate analysis.
Trap: nesting does not determine complexity. Two full n-step loops give Θ(n²), an outer n-step loop with an inner fixed ten steps gives Θ(n), and an inner loop of n² steps gives Θ(n³). Count total iterations. A two-pointer loop can be linear even with nested syntax if each pointer advances at most n times.
Essa pergunta tem uma armadilha que derruba muita gente em entrevista. Ela está marcada na resposta acima: vale reler antes de treinar.
Ler é o primeiro passo. No app, essa pergunta vira flashcard com repetição espaçada, e o módulo tem quiz e simulado para testar o que ficou.
Treinar essa pergunta no app