translation: Add Python and Java code for EN version (#1345)

* Add the intial translation of code of all the languages

* test

* revert

* Remove

* Add Python and Java code for EN version

en/codes/java/chapter_searching/binary_search.java

@@ -0,0 +1,58 @@
+/**
+ * File: binary_search.java
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_searching;
+
+public class binary_search {
+    /* Binary search (double closed interval) */
+    static int binarySearch(int[] nums, int target) {
+        // Initialize double closed interval [0, n-1], i.e., i, j point to the first element and last element of the array respectively
+        int i = 0, j = nums.length - 1;
+        // Loop until the search interval is empty (when i > j, it is empty)
+        while (i <= j) {
+            int m = i + (j - i) / 2; // Calculate midpoint index m
+            if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j]
+                i = m + 1;
+            else if (nums[m] > target) // This situation indicates that target is in the interval [i, m-1]
+                j = m - 1;
+            else // Found the target element, thus return its index
+                return m;
+        }
+        // Did not find the target element, thus return -1
+        return -1;
+    }
+
+    /* Binary search (left closed right open interval) */
+    static int binarySearchLCRO(int[] nums, int target) {
+        // Initialize left closed right open interval [0, n), i.e., i, j point to the first element and the last element +1 of the array respectively
+        int i = 0, j = nums.length;
+        // Loop until the search interval is empty (when i = j, it is empty)
+        while (i < j) {
+            int m = i + (j - i) / 2; // Calculate midpoint index m
+            if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j)
+                i = m + 1;
+            else if (nums[m] > target) // This situation indicates that target is in the interval [i, m)
+                j = m;
+            else // Found the target element, thus return its index
+                return m;
+        }
+        // Did not find the target element, thus return -1
+        return -1;
+    }
+
+    public static void main(String[] args) {
+        int target = 6;
+        int[] nums = { 1, 3, 6, 8, 12, 15, 23, 26, 31, 35 };
+
+        /* Binary search (double closed interval) */
+        int index = binarySearch(nums, target);
+        System.out.println("Index of target element 6 =" + index);
+
+        /* Binary search (left closed right open interval) */
+        index = binarySearchLCRO(nums, target);
+        System.out.println("Index of target element 6 =" + index);
+    }
+}