To rewrite something , but in your own words
Answer: 1 time.
Explanation:
- A binary function is also known as a half-interval search is a search algorithm to find the position of a given element x within a well-sorted array [].
- Binary search compares the target value to the middle element of the array.
- It ignores half of the elements just after one comparison.
- it compares x with the middle element.
So, the function read an element <u>one time</u> in the array before finding the value.
Answer:
public class TestImport{
public static void main(String[] args) {
String string1 = args[1];
String string2 = args[2];
System.out.println(string1 +" " +string2);
}
}
Explanation:
The solution here is to use string concatenation as has been used in this statement System.out.println(string1 +" " +string2);
When this code is run from the command line and passed atleast three command line arguments for index 0,1,2 respectively, the print statment will return the second string (that is index1) and the third argument(that is index2) with a space in-between the two string.