← Oracle questions
CodingReported in a candidate post, Sep 2024

Binary Search Complexity Derivation

Filed under Oracle

Explain the theoretical time complexity of binary search on a sorted array of size N and provide a step-by-step mathematical derivation of its O(log N) runtime.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.