From ef921e0254a07f083a50bb2884883f5604c78fe0 Mon Sep 17 00:00:00 2001
From: Priyansh Nama <54625644+priyanshnama@users.noreply.github.com>
Date: Tue, 15 Oct 2019 19:32:26 +0530
Subject: [PATCH] Create algorithm.java

code for binary search algorithm in java
---
 algorithm.java | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 algorithm.java

diff --git a/algorithm.java b/algorithm.java
new file mode 100644
index 0000000..8013a78
--- /dev/null
+++ b/algorithm.java
@@ -0,0 +1,27 @@
+class BinarySearch { 
+    int binarySearch(int arr[], int l, int r, int x) 
+    { 
+        if (r >= l) { 
+            int mid = l + (r - l) / 2;  
+            if (arr[mid] == x) 
+                return mid;  
+            if (arr[mid] > x) 
+                return binarySearch(arr, l, mid - 1, x); 
+            return binarySearch(arr, mid + 1, r, x); 
+        }
+        return -1; 
+    } 
+     
+    public static void main(String args[]) 
+    { 
+        BinarySearch ob = new BinarySearch(); 
+        int arr[] = { 2, 3, 4, 10, 40 }; 
+        int n = arr.length; 
+        int x = 10; 
+        int result = ob.binarySearch(arr, 0, n - 1, x); 
+        if (result == -1) 
+            System.out.println("Element not present"); 
+        else
+            System.out.println("Element found at index " + result); 
+    } 
+}