Written Java, Big-ONotation
![(13 points) Assuming the above definition of contains, what is the Big-O time complexity of this algorithm as a function of n, the size of the array? Explain your answer 2. public static void printContains (int [ array, int value) int n -array.length; if (contains (array, value)) for (int i - 0 i < 10; i++) System.out.println (array [0])](https://media.cheggcdn.com/media%2Ff4e%2Ff4e74e87-e759-4534-9c9d-d4f199e06682%2FphpcRI93f.png)
(13 points) Assuming the above definition of contains, what is the Big-O time complexity of this algorithm as a function of n, the size of the array? Explain your answer 2. public
PayPal Gateway not configured
PayPal Gateway not configured