Time Complexity · #58 · 2026-06-01

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.

What is the time complexity?

function middle(arr) {
  const mid = Math.floor(arr.length / 2);
  return arr[mid];
}

Loading your progress...

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