*JAVA ONLY*

/** * Return index where value is found in array or -1 if not found. * @param array ints where value may be found * @param value int that may be in array * @return index where value is found or -1 if not found */ 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()

1.

A) 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?

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

Additionally, what arguments could I add to the command line or surrounding the method itself to verify the answers to these questions?