From 8d4968850f125074fbec2a89306b46c05f39e563 Mon Sep 17 00:00:00 2001
From: lost1122 <56103421+lost1122@users.noreply.github.com>
Date: Mon, 7 Oct 2019 09:21:36 +0530
Subject: [PATCH] Create Binary Search

---
 Binary_Search.cpp | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Binary_Search.cpp

diff --git a/Binary_Search.cpp b/Binary_Search.cpp
new file mode 100644
index 0000000..f29f5cb
--- /dev/null
+++ b/Binary_Search.cpp
@@ -0,0 +1,42 @@
+// C program to implement recursive Binary Search 
+#include <stdio.h> 
+
+// A recursive binary search function. It returns 
+// location of x in given array arr[l..r] is present, 
+// otherwise -1 
+int binarySearch(int arr[], int l, int r, int x) 
+{ 
+	if (r >= l) { 
+		int mid = l + (r - l) / 2; 
+
+		// If the element is present at the middle 
+		// itself 
+		if (arr[mid] == x) 
+			return mid; 
+
+		// If element is smaller than mid, then 
+		// it can only be present in left subarray 
+		if (arr[mid] > x) 
+			return binarySearch(arr, l, mid - 1, x); 
+
+		// Else the element can only be present 
+		// in right subarray 
+		return binarySearch(arr, mid + 1, r, x); 
+	} 
+
+	// We reach here when element is not 
+	// present in array 
+	return -1; 
+} 
+
+int main(void) 
+{ 
+	int arr[] = { 2, 3, 4, 10, 40 }; 
+	int n = sizeof(arr) / sizeof(arr[0]); 
+	int x = 10; 
+	int result = binarySearch(arr, 0, n - 1, x); 
+	(result == -1) ? printf("Element is not present in array") 
+				: printf("Element is present at index %d", 
+							result); 
+	return 0; 
+}