binary_search_recur1.c

Author: realwujing

codes/c/chapter_divide_and_conquer/binary_search_recur1.c

@@ -0,0 +1,19 @@
+int dfs(int nums[], int target, int i, int j) {
+	if (i > j) {
+		return -1;
+	}
+
+	int m = (i + j) / 2;
+	if(nums[m] < target) {
+		return dfs(nums, target, m + 1, j);
+	} else if (nums[m] > target) {
+		return dfs(nums, target, i, m - 1);
+	} else {
+		return m;
+	}
+
+	int binarySearch(int nums[], int target, int numsSize) {
+		int n = numsSize;
+		return dfs(nums, target, 0, n - 1);
+	}
+}