Description

In this lab you will be writing five methods that operate on arrays. The five methods you must implement are as follows:

• Name: equals
  • Input: int[], int[]
  • Output: boolean
  • Description: This method returns true if the two arrays are equal, false otherwise. That is to say, if the int value at each index is the same between the two.


• Name: expand
  • Input: int[]
  • Output: int[]
  • Description: This method takes an array as a parameter and creates a new array of twice that array's length. It then copies the elements from the first array to the first half of the new array and returns the new array.


• Name: isSorted
  • Input: int[]
  • Output: boolean
  • Description: This method checks if an array is sorted in ascending order, i.e., the int values increase with larger indexes. Return true if it is sorted; false otherwise.


• Name: reverse
  • Input: int[]
  • Output: int[]
  • Description: This method takes an array as an argument and creates a new array of the same size. The new array is populated with the elements from the first array in reverse order. For example, if the input array has the elements 0, 9, and 2, the array that is returned should contain the elements 2, 9, and 0.


• Name: wheel
  • Input: int[], int
  • Output: int[]
  • Description: This method takes an array and an integer as arguments. It creates a new array of the same size as the input array and copies the values of the original array to the new array according to the following rules. The integer will be the "offset" for the array. The first array will be copied to the second starting with the index denoted by "offset" in the first array, and wrap around the end of the initial array. You may assume the offset is always between 0 and array.length - 1.
    

    Consider the following examples:
    array: {1, 2, 3}; offset: 2
    returns: {3, 1, 2}

    array: {1, 4, 9}; offset: 1
    returns: {4, 9, 1}
    The offset is 1, so the array is copied starting from index 1 (which is 4), then continuing to 0 (which is 1)

    array: {0, 5, 9, 20}; offset 0
    returns: {0, 5, 9, 20};
    The offset is 0 so the array does not change.

Implementation

The skeleton file ArrayUtils.java is provided for you as a starting point. Edit the Program Header to reflect your name and due date and implement each of the methods as described above. It is a good idea for you to add code to the main method to test the functions you've implemented. You will not be graded on any testing code you submit that is part of main.

Submission

For this assignment you will need to create a Jar file that contains your source code for ArrayUtils.java. Follow these instructions for creating a Jar file.
The Jar file you submit must be named yourlastname_lab7.jar, where yourlastname is your last name

Submit yourlastname_lab7.jar via the UNC Blackboard System under "Assignments → Lab 7" before the deadline.

Grading

• 4 points equals method
• 4 points expand method
• 4 points isSorted method
• 4 points reverse method
• 6 points wheel method
• 2 points Jar file submitted and named correctly
• 1 point Program Header edited correctly