Added Solution for Binary Search in Java (issue #5529)

[Sidhesh-Goud]

Enhancements:

Overflow Prevention: The mid-point calculation is optimized to avoid overflow when dealing with large arrays. Instead of using (left + right) / 2, we use left + (right - left) / 2.

Edge Case Handling: The algorithm checks if the input array is null or empty and handles it gracefully by returning -1 early.

Debugging Statements: Added debug statements to show the mid index and mid element during the execution, useful for understanding how the algorithm works step-by-step.

Readability: The code is organized with clear comments explaining each step, which is helpful when understanding or modifying the algorithm.

Time Complexity:
Best case: O(1) (if the target is at the middle)
Average and worst case: O(logn), where n is the number of elements in the array.

[alxkm]

There are already a bunch of different binary searches in the repository, what is the difference between these implementations?

https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/BinarySearch.java
https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/IterativeBinarySearch.java
https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/PerfectBinarySearch.java