Big O analysis

Question 1

The space complexity of function considers space taken by the inputs. True or false?

Answer 1

False

Question 2

What is the space complexity?

public static int getLargestItem(int[] items) {
int largest = Integer.MIN_VALUE;
for (int item : items) {
if (item > largest) {
largest = item;
}
}
return largest;
}

Answer 2

O(1)