Skip to content

Commit e40250d

Browse files
Adding 704-Binary-Search.c
1 parent 39fe33d commit e40250d

File tree

1 file changed

+30
-0
lines changed

1 file changed

+30
-0
lines changed

c/704-Binary-Search.c

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
/*
2+
Given an array of integers, search for a target value.
3+
Examples:
4+
nums = [-1,0,3,5,9,12], target = 9, return 4 (index of target 9)
5+
nums = [-1,0,3,5,9,12], target = 2, return -1 (not found)
6+
Array is sorted, so perform binary search
7+
8+
Time: O(log n)
9+
Space: O(1)
10+
*/
11+
12+
int search(int* nums, int numsSize, int target) {
13+
int left = 0;
14+
int right = numsSize-1;
15+
16+
while (left <= right) {
17+
int mid = left + (right - left) / 2;
18+
19+
if (nums[mid] == target) {
20+
return mid;
21+
}
22+
else if (nums[mid] < target) {
23+
left = mid + 1;
24+
}
25+
else {
26+
right = mid - 1;
27+
}
28+
}
29+
return -1;
30+
}

0 commit comments

Comments
 (0)