Question

Please do it in JAVA!!! Thank you. Directions below

Array Reverse :Step 1. In the reverse method of AList, implement your algorithm from the pre-lab exercises. Iteration is needed. Checkpoint: Compile and run ArrayListExtensionsTest. The checkReverse tests should pass. If not, debug and retest.

Array Cycle :Step 2. In the cycle method of AList, implement your algorithm from the pre-lab exercises. This method needs some form of iteration, but it may not be explicit. It can use the private methods of the AList class to avoid an explicit loop in the cycle method. Either way is acceptable. Checkpoint: : Compile and run ArrayListExtensionsTest. All tests should pass. If not, debug and retest.

------AList Skele--------

https://codeshare.io/GAJ4gE <---- I put Alist here cause it was too long to post

--------ArrayListExtensionsTest-------

https://codeshare.io/5Nb6jm <-------ArrayListExtensionsTest.java CODE TO RUN IT

Answer 1

/** Reverse the order of items in a list.
*/
public void reverse()
{
    if(initialized) {
        for (int i = 1; i <= numberOfEntries/2; i++) {
            T temp =  list[i];
            list[i] = list[numberOfEntries +1 - i];
            list[numberOfEntries +1 - i] = temp;
        }
    }
}


/** Cycle the first item to the end of the list.
*/
public void cycle()
{
    if(initialized) {
        if(numberOfEntries < 2) {
            return;
        }
        T first = list[1];
        for (int i = 1; i < numberOfEntries; i++) {
            list[i] = list[i+1];
        }
        list[numberOfEntries] = first;
    }  
}

Please upvote, as i have given the exact answer as asked in question. Still in case of any concerns in code, let me know in comments. Thanks!