Chapter 15, Problem 10E

Explanation of Solution

Adding the “longestSortedSequence” methods in “ArrayIntList” class:

//definition of "ArrayIntList" class

public class ArrayIntList

{

    //declare the required variables

    private int[] elementData;

    private int size;

    //refer the remaining methods in the textbook

    //definition of "longestSortedSquence" method

    public int longestSortedSequence ()

    {

        //check the size is 0

        if (size == 0)

        {

            //return the value

            return 0;

        }

        //otherwise

        else

        {

/*declare the variables and set the value*/

            int max = 1;

            int count = 1;

            //iterate "i" until reaches it size

            for (int i = 1; i < size; i++)

            {

                //check the condition

if (elementData[i] == elementData[i - 1])

                {

                    //increment the value

                    count++;

/*check the "count" is greater than "max"*/

                    if (count > max)

                    {

            �...