Answer:
When the element is not found we return -1.
Explanation:
When we use binary search we use BinarySearch() method of an array or list type when the element is found we return the index of the element if found if the element is not found we return -1.
We can decode this value since it is less than 0 and the indexing of arrays and lists starts with 0 upto the size-1.So -1 index is not present in the array or list.We have to check if the index is < 0 then the element is not present in the array or list.
for ex:-
if(index<0)
{
System.out.println("Element is not present in the array");
}
Answer: I believe it's software.
Answer:
O(n) which is a linear space complexity
Explanation:
Space complexity is the amount of memory space needed for a program code to be executed and return results. Space complexity depends on the input space and the auxiliary space used by the algorithm.
The list or array is an integer array of 'n' items, with the memory size 4*n, which is the memory size of an integer multiplied by the number of items in the list. The listSize, i, and arithmeticSum are all integers, the memory space is 4(3) = 12. The return statement passes the content of the arithmetic variable to another variable of space 4.
The total space complexity of the algorithm is "4n + 16" which is a linear space complexity.
Aerospace, petroleum, and automotive industries