From 9543e522f2e7b4f51c1aab81193a1cc76e487dd6 Mon Sep 17 00:00:00 2001
From: Faizan Ahamed <faizanahamed1414@gmail.com>
Date: Sun, 26 Apr 2020 14:46:20 +0530
Subject: [PATCH] Update Binary Search.cpp

---
 search/Binary Search.cpp | 52 ++++++++++++++++++++--------------------
 1 file changed, 26 insertions(+), 26 deletions(-)

diff --git a/search/Binary Search.cpp b/search/Binary Search.cpp
index 8c28611d9..dc46b5e02 100644
--- a/search/Binary Search.cpp	
+++ b/search/Binary Search.cpp	
@@ -1,31 +1,31 @@
 #include <iostream>
 int binary_search(int a[], int l, int r, int key) {
-	while (l <= r) {
-		int m = l + (r - l) / 2;
-		if (key == a[m])
-			return m;
-		else if (key < a[m])
-			r = m - 1;
-		else
-			l = m + 1;
-	}
-	return -1;
+while (l <= r) {
+int m = l + (r - l) / 2;
+if (key == a[m])
+return m;
+else if (key < a[m])
+r = m - 1;
+else
+l = m + 1;
+}
+return -1;
 }
 int main(int argc, char const *argv[]) {
-	int n, key;
-	std::cout << "Enter size of array: ";
-	std::cin >> n;
-	std::cout << "Enter array elements: ";
-	int* a = new int[n];
-	for (int i = 0; i < n; i++) {
-		std::cin >> a[i];
-	}
-	std::cout << "Enter search key: ";
-	std::cin >> key;
-	int res = binary_search(a, 0, n - 1, key);
-	if (res != -1)
-		std::cout << key << " found at index " << res << endl;
-	else
-		std::cout << key << " not found" << endl;
-	return 0;
+int n, key;
+std::cout << "Enter size of array: ";
+std::cin >> n;
+std::cout << "Enter array elements: ";
+int* a = new int[n];
+for (int i = 0; i < n; i++) {
+std::cin >> a[i];
+}
+std::cout << "Enter search key: ";
+std::cin >> key;
+int res = binary_search(a, 0, n - 1, key);
+if (res != -1)
+std::cout << key << " found at index " << res << endl;
+else
+std::cout << key << " not found" << endl;
+return 0;
 }