Write a Java program to implement a binary search algorithm to search for a target element in a sorted array. Provide an explanation of your approach and the time and space complexity of your solution.

I want this in python code and explanation step by step

Write the javascript and the C++ code for this language. Right answer will be given thumbs up.

it's not a programming question.

Implement a function in Java to find the largest and smallest elements in an array of integers, and return them in a pair. The function should have a time complexity of O(n) and a space complexity of O(1).

Using Java Modify the program 1 to compute the multiplication of two vectors with the sizes mx1 and 1xn. The result is a matrix mxn computed as follows: the element on the position r and c in the product will be equal with m1[r][0]*m2[0][c].