Undetectable

On your screen. Not in your screen share.

Included in Pro and Pro Max

What you see
ScreenQuick one before we move on: what's the time complexity of binary search?

O(log n). Each step halves the range that's left.

  • Needs sorted input.
  • Worst case for a million items: about 20 steps.
What the screen share shows
Not in the share

Up next

Try it

Pick a call, press play, and watch an answer stream in.

Free to start, with 30 free credits. Mac and Windows.