Skip to main content
{} stackoverfun

Time Complexity · #46 · 2026-05-20

What's the Big-O?

JavaScript ·Difficulty 1/3

How to play

Read the code and pick its time complexity from four Big-O choices. Think about loops, recursion, and hidden costs. Press 1–4 or click to answer.

Given an array of n elements, what is the worst-case time complexity?

function find(arr, target) {
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] === target) return i;
  }
  return -1;
}

Loading your progress...

Press 1 through 4, or tap a numbered choice, to answer. Back to hub