Binary Search
DSA
Medium
13 views
Problem Description
Search for a target element in a sorted array by repeatedly dividing the search space into two halves until the element is found or the search space becomes empty.
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!