[Git & Collaboration] Binary Search Implementation

Question

Problem Statement for Binary Search Implementation under Git & Collaboration:

Given an array of integers nums sorted in ascending order, and an integer target, write a function to search target in nums.

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def search(nums, target):
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = (left + right) // 2
        if nums[mid] == target:
            return mid
        elif nums[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1
```

[Git & Collaboration] Binary Search Implementation

Problem Statement

Proposed Solution

Your Progress

Save Progress?