Question: Question 1 1 pts Consider the following Java code: public static int findBiggestProduct(int] a)f int x = 0; for (int i = 0; i x)

Question 1 1 pts Consider the following Java code: public static int findBiggestProduct(int] a)f int x = 0; for (int i = 0; i x) x = a[i]*a[j); return x Which of the following is the best characterization of its running behavior (e.g. T(n) = the number of CPU instructions executed by running findBiggestProduct given an array of n random ints) using O- notation? O 0(1) O O(n) O Oln2) O O(n3)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
