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_sorting/bubble_sort.java

@@ -0,0 +1,57 @@
+/**
+ * File: bubble_sort.java
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class bubble_sort {
+    /* Bubble sort */
+    static void bubbleSort(int[] nums) {
+        // Outer loop: unsorted range is [0, i]
+        for (int i = nums.length - 1; i > 0; i--) {
+            // Inner loop: swap the largest element in the unsorted range [0, i] to the right end of the range
+            for (int j = 0; j < i; j++) {
+                if (nums[j] > nums[j + 1]) {
+                    // Swap nums[j] and nums[j + 1]
+                    int tmp = nums[j];
+                    nums[j] = nums[j + 1];
+                    nums[j + 1] = tmp;
+                }
+            }
+        }
+    }
+
+    /* Bubble sort (optimized with flag) */
+    static void bubbleSortWithFlag(int[] nums) {
+        // Outer loop: unsorted range is [0, i]
+        for (int i = nums.length - 1; i > 0; i--) {
+            boolean flag = false; // Initialize flag
+            // Inner loop: swap the largest element in the unsorted range [0, i] to the right end of the range
+            for (int j = 0; j < i; j++) {
+                if (nums[j] > nums[j + 1]) {
+                    // Swap nums[j] and nums[j + 1]
+                    int tmp = nums[j];
+                    nums[j] = nums[j + 1];
+                    nums[j + 1] = tmp;
+                    flag = true; // Record swapped elements
+                }
+            }
+            if (!flag)
+                break; // If no elements were swapped in this round of "bubbling", exit
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = { 4, 1, 3, 1, 5, 2 };
+        bubbleSort(nums);
+        System.out.println("After bubble sort, nums = " + Arrays.toString(nums));
+
+        int[] nums1 = { 4, 1, 3, 1, 5, 2 };
+        bubbleSortWithFlag(nums1);
+        System.out.println("After bubble sort, nums1 = " + Arrays.toString(nums1));
+    }
+}

en/codes/java/chapter_sorting/bucket_sort.java

@@ -0,0 +1,47 @@
+/**
+ * File: bucket_sort.java
+ * Created Time: 2023-03-17
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class bucket_sort {
+    /* Bucket sort */
+    static void bucketSort(float[] nums) {
+        // Initialize k = n/2 buckets, expected to allocate 2 elements per bucket
+        int k = nums.length / 2;
+        List<List<Float>> buckets = new ArrayList<>();
+        for (int i = 0; i < k; i++) {
+            buckets.add(new ArrayList<>());
+        }
+        // 1. Distribute array elements into various buckets
+        for (float num : nums) {
+            // Input data range is [0, 1), use num * k to map to index range [0, k-1]
+            int i = (int) (num * k);
+            // Add num to bucket i
+            buckets.get(i).add(num);
+        }
+        // 2. Sort each bucket
+        for (List<Float> bucket : buckets) {
+            // Use built-in sorting function, can also replace with other sorting algorithms
+            Collections.sort(bucket);
+        }
+        // 3. Traverse buckets to merge results
+        int i = 0;
+        for (List<Float> bucket : buckets) {
+            for (float num : bucket) {
+                nums[i++] = num;
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        // Assume input data is floating point, range [0, 1)
+        float[] nums = { 0.49f, 0.96f, 0.82f, 0.09f, 0.57f, 0.43f, 0.91f, 0.75f, 0.15f, 0.37f };
+        bucketSort(nums);
+        System.out.println("After bucket sort, nums = " + Arrays.toString(nums));
+    }
+}

en/codes/java/chapter_sorting/counting_sort.java

@@ -0,0 +1,78 @@
+/**
+ * File: counting_sort.java
+ * Created Time: 2023-03-17
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class counting_sort {
+    /* Counting sort */
+    // Simple implementation, cannot be used for sorting objects
+    static void countingSortNaive(int[] nums) {
+        // 1. Count the maximum element m in the array
+        int m = 0;
+        for (int num : nums) {
+            m = Math.max(m, num);
+        }
+        // 2. Count the occurrence of each digit
+        // counter[num] represents the occurrence of num
+        int[] counter = new int[m + 1];
+        for (int num : nums) {
+            counter[num]++;
+        }
+        // 3. Traverse counter, filling each element back into the original array nums
+        int i = 0;
+        for (int num = 0; num < m + 1; num++) {
+            for (int j = 0; j < counter[num]; j++, i++) {
+                nums[i] = num;
+            }
+        }
+    }
+
+    /* Counting sort */
+    // Complete implementation, can sort objects and is a stable sort
+    static void countingSort(int[] nums) {
+        // 1. Count the maximum element m in the array
+        int m = 0;
+        for (int num : nums) {
+            m = Math.max(m, num);
+        }
+        // 2. Count the occurrence of each digit
+        // counter[num] represents the occurrence of num
+        int[] counter = new int[m + 1];
+        for (int num : nums) {
+            counter[num]++;
+        }
+        // 3. Calculate the prefix sum of counter, converting "occurrence count" to "tail index"
+        // counter[num]-1 is the last index where num appears in res
+        for (int i = 0; i < m; i++) {
+            counter[i + 1] += counter[i];
+        }
+        // 4. Traverse nums in reverse order, placing each element into the result array res
+        // Initialize the array res to record results
+        int n = nums.length;
+        int[] res = new int[n];
+        for (int i = n - 1; i >= 0; i--) {
+            int num = nums[i];
+            res[counter[num] - 1] = num; // Place num at the corresponding index
+            counter[num]--; // Decrement the prefix sum by 1, getting the next index to place num
+        }
+        // Use result array res to overwrite the original array nums
+        for (int i = 0; i < n; i++) {
+            nums[i] = res[i];
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = { 1, 0, 1, 2, 0, 4, 0, 2, 2, 4 };
+        countingSortNaive(nums);
+        System.out.println("After count sort (unable to sort objects), nums = " + Arrays.toString(nums));
+
+        int[] nums1 = { 1, 0, 1, 2, 0, 4, 0, 2, 2, 4 };
+        countingSort(nums1);
+        System.out.println("After count sort, nums1 = " + Arrays.toString(nums1));
+    }
+}

en/codes/java/chapter_sorting/heap_sort.java

@@ -0,0 +1,57 @@
+/**
+ * File: heap_sort.java
+ * Created Time: 2023-05-26
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.Arrays;
+
+public class heap_sort {
+    /* Heap length is n, start heapifying node i, from top to bottom */
+    public static void siftDown(int[] nums, int n, int i) {
+        while (true) {
+            // Determine the largest node among i, l, r, noted as ma
+            int l = 2 * i + 1;
+            int r = 2 * i + 2;
+            int ma = i;
+            if (l < n && nums[l] > nums[ma])
+                ma = l;
+            if (r < n && nums[r] > nums[ma])
+                ma = r;
+            // If node i is the largest or indices l, r are out of bounds, no further heapification needed, break
+            if (ma == i)
+                break;
+            // Swap two nodes
+            int temp = nums[i];
+            nums[i] = nums[ma];
+            nums[ma] = temp;
+            // Loop downwards heapification
+            i = ma;
+        }
+    }
+
+    /* Heap sort */
+    public static void heapSort(int[] nums) {
+        // Build heap operation: heapify all nodes except leaves
+        for (int i = nums.length / 2 - 1; i >= 0; i--) {
+            siftDown(nums, nums.length, i);
+        }
+        // Extract the largest element from the heap and repeat for n-1 rounds
+        for (int i = nums.length - 1; i > 0; i--) {
+            // Swap the root node with the rightmost leaf node (swap the first element with the last element)
+            int tmp = nums[0];
+            nums[0] = nums[i];
+            nums[i] = tmp;
+            // Start heapifying the root node, from top to bottom
+            siftDown(nums, i, 0);
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = { 4, 1, 3, 1, 5, 2 };
+        heapSort(nums);
+        System.out.println("After heap sort, nums = " + Arrays.toString(nums));
+    }
+}

en/codes/java/chapter_sorting/insertion_sort.java

@@ -0,0 +1,31 @@
+/**
+ * File: insertion_sort.java
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class insertion_sort {
+    /* Insertion sort */
+    static void insertionSort(int[] nums) {
+        // Outer loop: sorted range is [0, i-1]
+        for (int i = 1; i < nums.length; i++) {
+            int base = nums[i], j = i - 1;
+            // Inner loop: insert base into the correct position within the sorted range [0, i-1]
+            while (j >= 0 && nums[j] > base) {
+                nums[j + 1] = nums[j]; // Move nums[j] to the right by one position
+                j--;
+            }
+            nums[j + 1] = base;        // Assign base to the correct position
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = { 4, 1, 3, 1, 5, 2 };
+        insertionSort(nums);
+        System.out.println("After insertion sort, nums = " + Arrays.toString(nums));
+    }
+}

en/codes/java/chapter_sorting/merge_sort.java

@@ -0,0 +1,58 @@
+/**
+ * File: merge_sort.java
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class merge_sort {
+    /* Merge left subarray and right subarray */
+    static void merge(int[] nums, int left, int mid, int right) {
+        // Left subarray interval is [left, mid], right subarray interval is [mid+1, right]
+        // Create a temporary array tmp to store the merged results
+        int[] tmp = new int[right - left + 1];
+        // Initialize the start indices of the left and right subarrays
+        int i = left, j = mid + 1, k = 0;
+        // While both subarrays still have elements, compare and copy the smaller element into the temporary array
+        while (i <= mid && j <= right) {
+            if (nums[i] <= nums[j])
+                tmp[k++] = nums[i++];
+            else
+                tmp[k++] = nums[j++];
+        }
+        // Copy the remaining elements of the left and right subarrays into the temporary array
+        while (i <= mid) {
+            tmp[k++] = nums[i++];
+        }
+        while (j <= right) {
+            tmp[k++] = nums[j++];
+        }
+        // Copy the elements from the temporary array tmp back to the original array nums at the corresponding interval
+        for (k = 0; k < tmp.length; k++) {
+            nums[left + k] = tmp[k];
+        }
+    }
+
+    /* Merge sort */
+    static void mergeSort(int[] nums, int left, int right) {
+        // Termination condition
+        if (left >= right)
+            return; // Terminate recursion when subarray length is 1
+        // Partition stage
+        int mid = (left + right) / 2; // Calculate midpoint
+        mergeSort(nums, left, mid); // Recursively process the left subarray
+        mergeSort(nums, mid + 1, right); // Recursively process the right subarray
+        // Merge stage
+        merge(nums, left, mid, right);
+    }
+
+    public static void main(String[] args) {
+        /* Merge sort */
+        int[] nums = { 7, 3, 2, 6, 0, 1, 5, 4 };
+        mergeSort(nums, 0, nums.length - 1);
+        System.out.println("After merge sort, nums = " + Arrays.toString(nums));
+    }
+}

en/codes/java/chapter_sorting/quick_sort.java

@@ -0,0 +1,158 @@
+/**
+ * File: quick_sort.java
+ * Created Time: 2022-11-25
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+/* Quick sort class */
+class QuickSort {
+    /* Swap elements */
+    static void swap(int[] nums, int i, int j) {
+        int tmp = nums[i];
+        nums[i] = nums[j];
+        nums[j] = tmp;
+    }
+
+    /* Partition */
+    static int partition(int[] nums, int left, int right) {
+        // Use nums[left] as the pivot
+        int i = left, j = right;
+        while (i < j) {
+            while (i < j && nums[j] >= nums[left])
+                j--;          // Search from right to left for the first element smaller than the pivot
+            while (i < j && nums[i] <= nums[left])
+                i++;          // Search from left to right for the first element greater than the pivot
+            swap(nums, i, j); // Swap these two elements
+        }
+        swap(nums, i, left);  // Swap the pivot to the boundary between the two subarrays
+        return i;             // Return the index of the pivot
+    }
+
+    /* Quick sort */
+    public static void quickSort(int[] nums, int left, int right) {
+        // Terminate recursion when subarray length is 1
+        if (left >= right)
+            return;
+        // Partition
+        int pivot = partition(nums, left, right);
+        // Recursively process the left subarray and right subarray
+        quickSort(nums, left, pivot - 1);
+        quickSort(nums, pivot + 1, right);
+    }
+}
+
+/* Quick sort class (median pivot optimization) */
+class QuickSortMedian {
+    /* Swap elements */
+    static void swap(int[] nums, int i, int j) {
+        int tmp = nums[i];
+        nums[i] = nums[j];
+        nums[j] = tmp;
+    }
+
+    /* Select the median of three candidate elements */
+    static int medianThree(int[] nums, int left, int mid, int right) {
+        int l = nums[left], m = nums[mid], r = nums[right];
+        if ((l <= m && m <= r) || (r <= m && m <= l))
+            return mid; // m is between l and r
+        if ((m <= l && l <= r) || (r <= l && l <= m))
+            return left; // l is between m and r
+        return right;
+    }
+
+    /* Partition (median of three) */
+    static int partition(int[] nums, int left, int right) {
+        // Select the median of three candidate elements
+        int med = medianThree(nums, left, (left + right) / 2, right);
+        // Swap the median to the array's leftmost position
+        swap(nums, left, med);
+        // Use nums[left] as the pivot
+        int i = left, j = right;
+        while (i < j) {
+            while (i < j && nums[j] >= nums[left])
+                j--;          // Search from right to left for the first element smaller than the pivot
+            while (i < j && nums[i] <= nums[left])
+                i++;          // Search from left to right for the first element greater than the pivot
+            swap(nums, i, j); // Swap these two elements
+        }
+        swap(nums, i, left);  // Swap the pivot to the boundary between the two subarrays
+        return i;             // Return the index of the pivot
+    }
+
+    /* Quick sort */
+    public static void quickSort(int[] nums, int left, int right) {
+        // Terminate recursion when subarray length is 1
+        if (left >= right)
+            return;
+        // Partition
+        int pivot = partition(nums, left, right);
+        // Recursively process the left subarray and right subarray
+        quickSort(nums, left, pivot - 1);
+        quickSort(nums, pivot + 1, right);
+    }
+}
+
+/* Quick sort class (tail recursion optimization) */
+class QuickSortTailCall {
+    /* Swap elements */
+    static void swap(int[] nums, int i, int j) {
+        int tmp = nums[i];
+        nums[i] = nums[j];
+        nums[j] = tmp;
+    }
+
+    /* Partition */
+    static int partition(int[] nums, int left, int right) {
+        // Use nums[left] as the pivot
+        int i = left, j = right;
+        while (i < j) {
+            while (i < j && nums[j] >= nums[left])
+                j--;          // Search from right to left for the first element smaller than the pivot
+            while (i < j && nums[i] <= nums[left])
+                i++;          // Search from left to right for the first element greater than the pivot
+            swap(nums, i, j); // Swap these two elements
+        }
+        swap(nums, i, left);  // Swap the pivot to the boundary between the two subarrays
+        return i;             // Return the index of the pivot
+    }
+
+    /* Quick sort (tail recursion optimization) */
+    public static void quickSort(int[] nums, int left, int right) {
+        // Terminate when subarray length is 1
+        while (left < right) {
+            // Partition operation
+            int pivot = partition(nums, left, right);
+            // Perform quick sort on the shorter of the two subarrays
+            if (pivot - left < right - pivot) {
+                quickSort(nums, left, pivot - 1); // Recursively sort the left subarray
+                left = pivot + 1; // Remaining unsorted interval is [pivot + 1, right]
+            } else {
+                quickSort(nums, pivot + 1, right); // Recursively sort the right subarray
+                right = pivot - 1; // Remaining unsorted interval is [left, pivot - 1]
+            }
+        }
+    }
+}
+
+public class quick_sort {
+    public static void main(String[] args) {
+        /* Quick sort */
+        int[] nums = { 2, 4, 1, 0, 3, 5 };
+        QuickSort.quickSort(nums, 0, nums.length - 1);
+        System.out.println("After quick sort, nums = " + Arrays.toString(nums));
+
+        /* Quick sort (median pivot optimization) */
+        int[] nums1 = { 2, 4, 1, 0, 3, 5 };
+        QuickSortMedian.quickSort(nums1, 0, nums1.length - 1);
+        System.out.println("After quick sort with median pivot optimization, nums1 = " + Arrays.toString(nums1));
+
+        /* Quick sort (tail recursion optimization) */
+        int[] nums2 = { 2, 4, 1, 0, 3, 5 };
+        QuickSortTailCall.quickSort(nums2, 0, nums2.length - 1);
+        System.out.println("After quick sort with tail recursion optimization, nums2 = " + Arrays.toString(nums2));
+    }
+}

en/codes/java/chapter_sorting/radix_sort.java

@@ -0,0 +1,69 @@
+/**
+ * File: radix_sort.java
+ * Created Time: 2023-01-17
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.*;
+
+public class radix_sort {
+    /* Get the k-th digit of element num, where exp = 10^(k-1) */
+    static int digit(int num, int exp) {
+        // Passing exp instead of k can avoid repeated expensive exponentiation here
+        return (num / exp) % 10;
+    }
+
+    /* Counting sort (based on nums k-th digit) */
+    static void countingSortDigit(int[] nums, int exp) {
+        // Decimal digit range is 0~9, therefore need a bucket array of length 10
+        int[] counter = new int[10];
+        int n = nums.length;
+        // Count the occurrence of digits 0~9
+        for (int i = 0; i < n; i++) {
+            int d = digit(nums[i], exp); // Get the k-th digit of nums[i], noted as d
+            counter[d]++;                // Count the occurrence of digit d
+        }
+        // Calculate prefix sum, converting "occurrence count" into "array index"
+        for (int i = 1; i < 10; i++) {
+            counter[i] += counter[i - 1];
+        }
+        // Traverse in reverse, based on bucket statistics, place each element into res
+        int[] res = new int[n];
+        for (int i = n - 1; i >= 0; i--) {
+            int d = digit(nums[i], exp);
+            int j = counter[d] - 1; // Get the index j for d in the array
+            res[j] = nums[i];       // Place the current element at index j
+            counter[d]--;           // Decrease the count of d by 1
+        }
+        // Use result to overwrite the original array nums
+        for (int i = 0; i < n; i++)
+            nums[i] = res[i];
+    }
+
+    /* Radix sort */
+    static void radixSort(int[] nums) {
+        // Get the maximum element of the array, used to determine the maximum number of digits
+        int m = Integer.MIN_VALUE;
+        for (int num : nums)
+            if (num > m)
+                m = num;
+        // Traverse from the lowest to the highest digit
+        for (int exp = 1; exp <= m; exp *= 10) {
+            // Perform counting sort on the k-th digit of array elements
+            // k = 1 -> exp = 1
+            // k = 2 -> exp = 10
+            // i.e., exp = 10^(k-1)
+            countingSortDigit(nums, exp);
+        }
+    }
+
+    public static void main(String[] args) {
+        // Radix sort
+        int[] nums = { 10546151, 35663510, 42865989, 34862445, 81883077,
+                       88906420, 72429244, 30524779, 82060337, 63832996 };
+        radixSort(nums);
+        System.out.println("After radix sort, nums = " + Arrays.toString(nums));
+    }
+}

en/codes/java/chapter_sorting/selection_sort.java

@@ -0,0 +1,35 @@
+/**
+ * File: selection_sort.java
+ * Created Time: 2023-05-23
+ * Author: krahets (krahets@163.com)
+ */
+
+package chapter_sorting;
+
+import java.util.Arrays;
+
+public class selection_sort {
+    /* Selection sort */
+    public static void selectionSort(int[] nums) {
+        int n = nums.length;
+        // Outer loop: unsorted range is [i, n-1]
+        for (int i = 0; i < n - 1; i++) {
+            // Inner loop: find the smallest element within the unsorted range
+            int k = i;
+            for (int j = i + 1; j < n; j++) {
+                if (nums[j] < nums[k])
+                    k = j; // Record the index of the smallest element
+            }
+            // Swap the smallest element with the first element of the unsorted range
+            int temp = nums[i];
+            nums[i] = nums[k];
+            nums[k] = temp;
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] nums = { 4, 1, 3, 1, 5, 2 };
+        selectionSort(nums);
+        System.out.println("After selection sort, nums = " + Arrays.toString(nums));
+    }
+}