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


    Question

    Which of the following is true for the time complexity

    of binary search?
    A O(n²) Correct Answer Incorrect Answer
    B O(n log n) Correct Answer Incorrect Answer
    C O(log n) Correct Answer Incorrect Answer
    D O(n) Correct Answer Incorrect Answer
    E O(1) Correct Answer Incorrect Answer

    Solution

    Binary search divides the search space in half each time, giving a logarithmic time complexity.

    Practice Next
    More Algorithms Questions
    ask-question