Computer Sciences > GATE 2021 SET-2 > Binary Search

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?

A

Θ(√n)

B

Θ(log₂(n))

C

Θ(n²)

D

Θ(n)

Check Answer

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science