I’m working on a java question and need an explanation to help me learn.
Implement each of the following functions and write a basic main() function that tests each./** * * @author PLEASE ADD YOUR NAME */public class ArrayPractice { /* sets every item in the array A references to initialValue */ public static void initialize(int A[], int initialValue) { ; } /* * returns the average of the items in the array A references. Be careful: the array contains int * but the method returns double. What do we do to handle this? */ public static double average(int A[]) { return 0.0; } /* returns the number of times that x appears in the array A references */ public static int numOccurrences(int A[], int x) { return 0; } /* * returns the index of the first occurrence of x in the array A references or -1 if x doesn’t * exist in the array */ public static int find(int A[], int x) { return -1; } /* * Returns the index of the first occurrence of item within the first n elements of the array A[] * references or -1 if item is not among the first n elements of the array */ public static int findN(int A[], int item, int n) { return -1; } /* * returns the index of the last occurrence of x in the array A references or -1 if x doesn’t * exist in the array */ public static int findLast(int A[], int x) { return -1; } /* returns the largest item found in the array A references */ public static int largest(int A[]) { return 0; } /* returns the index of the largest item found in the array A references */ public static int indexOfLargest(int A[]) { return 0; } /* * returns the index of the largest odd number in the array A references or -1 if the array * contains no odd numbers */ public static int indexOfLargestOdd(int A[]) { return -1; } /* * returns a new array consisting of all of the elements of A[] */ public static int[] copy(int A[]) { return null; } /* * Returns a reference to a new array consisting of all of the first n elements of A[]. If * n>A.length, returns a reference to a new array of size n, with the first A.length elements * exactly the same as A, and the remaining n-A.length elements set to 0. If n x one position to the left and filling in a 0 at the */ /* right-most position in the array.
*/ /* if x is an invalid index, returns -1. */ /* For example, if before we call function with x = 2, */ /* the the array is: */ /* after the function finishes, the array is: */ /* and the function returns 30 */ public static int remove(int[] A, int x) { return -1; } /* shifts all elements of the array A references one position to the left, */ /* removing the first element and filling in 0 from the right hand side. */ /* For example, if before we call the function the the array is: */ /* after the function finishes, the array is: */public static void shiftLeft(int[] A) { ; } /* * returns true if A is in sorted ascending order and false otherwise */ public static boolean isSortedAscending(int[] A) { return false; } /* Returns the number of items in the array that A references starting at index x that are in */ /* ascending sorted order. */ /* For example, if the array is: */ /* and x is 0, the function return 2, because 10 and 11 are in sorted order. */ /* If x is 5, the function returns 4, because 6, 18, 37, and 40 are in sorted order. */ /* * If x is 2, the function returns 1. * */ public static int sortedAscendingRun(int[] A, int x) { return -1; } /* * returns a new array consisting of all of the elements of A[] followed by all of the elements of * B[]. For example, if A[] is: {10,20,30} and B[] is: {5, 9, 38}, the method returns the array : * {10,20,30,5,9,38} */ public static int[] copyAll(int A[], int B[]) { return null; } /* * reverses the order of the elements in A[]. For example, if A[] is: {10,20,30,40,50}, after the * method, A[] would be {50,40,30,20,10} */ public static void reverse(int A[]) { ; } /* * Extra credit: * * Returns a new array consisting of all of the elements of A, but with no duplicates. For * example, if A[] is {10,20,5,32,5,10,9,32,8}, the method returns the array {10,20,5,32,9,8} */ public static int[] uniques(int A[]) { return null; }}
Requirements: any