Binary Search

BinarySearch.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+
+/* If x in into array return 0, else 1 */
+int binarySearch(int[], int, int, int);
+
+int main() {
+	int arr[] = {5, 15, 24, 32, 56, 89};
+	int size_of_array = sizeof(arr) / sizeof(int);
+	/* Check if 24 is into arr */
+	printf("%d\n", binarySearch(arr, 24, 0, size_of_array-1));
+	/* Check if 118 is into arr */
+	printf("%d\n", binarySearch(arr, 118, 0, size_of_array-1));
+	return 0;
+}
+
+int binarySearch(int array[], int number, int start, int end) {
+	if(start >= end) {
+		return array[start] == number ? 0 : 1;
+	}
+
+	int tmp = (int) end / 2;
+	if(number == array[tmp]) {
+		return 0;
+	} else if(number > array[tmp]) {
+		return binarySearch(array, number, start, tmp);
+	} else {
+		return binarySearch(array, number, tmp, end);
+	}
+}
+
+