📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    The time complexity of binary search

    is:
    A O(n) Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n²) Correct Answer Incorrect Answer
    D O(1) Correct Answer Incorrect Answer
    E O(n log n) Correct Answer Incorrect Answer

    Solution

    Binary search divides array by half each time → logarithmic.

    Practice Next
    ask-question