Binary Search Time Complexity | Dataford Interview Questions

What is the time complexity of the binary search algorithm?

Asked in the Technical interview stage. Implement iterative binary search to apply the complexity being tested.

Input and Output

Given a sorted list of integers nums in ascending order and an integer target, return the index of target, or -1 if it is absent. If duplicates exist, return any matching index.

Function signature: def binary_search(nums, target):

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i], target <= 10^9
nums is sorted in ascending order
If duplicates exist, returning any matching index is valid

Function Signature

def binary_search(nums, target):

Your question is Binary Search Time Complexity. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem