Question

In Java write the following array- processing methods into the same application, Lab13.java. Use the main method in this application to test your methods.

1) Write the void method, shiftLeft, which accepts an array of int and changes the elements of this array so that the index of each element is now less by one and the last element of the array is now zero. For example, if the parameter array is {7, 3, 2, 9, 5}, then when this method returns to the caller, the elements will be {3, 2, 9, 5, 0}.

Then override the void method, shiftLeft, so that it now accepts two parameters: an array of int and an integer, n. This method shifts the first (array) parameter left as did the original version of shiftLeft, but does so n (the second parameter) times. For example, if the parameter array is {7, 3, 2, 9, 5} and the integer is 4, then when this method returns to the caller, the elements will have been changed to {5, 0, 0, 0, 0}.

Note: You do not need to get the user input

Answer 1

public class Lab13 {

    public static int range(int[] arr) {
        int min = arr[0], max = arr[0];
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] < min)
                min = arr[i];
            if (arr[i] > max)
                max = arr[i];
        }
        return max - min;
    }

    public static boolean isSorted(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            if (arr[i - 1] > arr[i]) {
                return false;
            }
        }
        return true;
    }

    public static void shiftLeft(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            arr[i] = arr[i + 1];
        }
        if (arr.length > 0)
            arr[arr.length - 1] = 0;
    }

    public static void shiftLeft(int[] arr, int n) {
        for (int i = 0; i < arr.length; i++) {
            if (i < arr.length - n) {
                arr[i] = arr[i + n];
            } else {
                arr[i] = 0;
            }
        }
    }

}