public static int find(int[] array, int value) { for (int i = 0; i < array.length; i++) { if (array[i] == value) { return i; } } return -1; } 

Algorithm: find()

D) Expected Average Case Scenario. Assuming a randomly ordered array of unique elements and the target element is in the array, where would a target element be located on average? What is the expected average number of loop iterations for a call to find()? What is the average growth function under these conditions?

E) What is the runtime order (big-O) of find() based on the above growth functions?