diff --git a/client/src/pages/guide/english/algorithms/search-algorithms/binary-search/index.md b/client/src/pages/guide/english/algorithms/search-algorithms/binary-search/index.md
index 3825bb845b..6030aad9f0 100644
--- a/client/src/pages/guide/english/algorithms/search-algorithms/binary-search/index.md
+++ b/client/src/pages/guide/english/algorithms/search-algorithms/binary-search/index.md
@@ -302,6 +302,38 @@ func binarySearch(for number: Int, in numbers: [Int]) -> Int? {
     }
     return nil // the given number was not found
 }
+```
+### Example in Java 
+```Java 
+// Iterative Approach in Java
+int binarySearch(int[] arr, int start, int end, int element)
+{
+    while(start <= end)
+    {
+        int mid = ( start + end ) / 2;
+        if(arr[mid] == element)
+            return mid;
+        if(arr[mid] < element)
+            start = mid+1;
+        else
+            end = mid-1;
+    }
+   return -1;
+}
+```
+```Java 
+// Recursive Approach in Java
+int binarySearch(int[] arr, int start,int end , int element)
+{
+    int mid = ( start + end ) / 2;
+    if(arr[mid] ==  element)
+        return mid;
+    if(arr[mid] < element)
+        return binarySearch( arr , mid + 1 , end , element );
+    else
+        return binarySearch( arr, start, mid - 1 , element);
+}
+
 ```
 
 ### More Information