Binary Search Implementation

medium Algorithms 25 points

Implement a binary search algorithm that takes a sorted array and a target value, and returns the index of the target if found, or -1 if not found.

Problem Description

Implement a binary search algorithm that takes a sorted array and a target value, and returns the index of the target if found, or -1 if not found.

Example

Input: [1,3,5,7,9], 5

Output: 2

25 Points

Reward

medium

Difficulty

No limit

Time Limit

Total Submissions 0

Accepted 28

Success Rate 0%