Authors:
Stuart Reges, Marty Stepp
Chapter:
Implementing A Collection Class
Exercise:
Exercises
Question:8 | ISBN:9780136091813 | Edition: 2
Question
Add the following method to the ArrayIntList class from this chapter.
Write a method called longestSortedSequence that returns the length of the longest sorted sequence within a list of integers. For example, if a variable called list stores [1, 3, 5, 2, 9, 7, -3, 0, 42, 308, 17] , then the call of list.longestSortedSequence() would return 4 because it is the length of the longest sorted sequence within this list (the sequence –3, 0, 42, 308 ). If the list is empty, your method should return 0 . Notice that for a nonempty list the method will always return a value of at least 1 because any individual element constitutes a sorted sequence.
Answer
Implementation of longestSortedSequence method:
public int longestSortedSequence()
{
if(size == 0)
return 0;
int longest = 1;
int count = 1;
for(int i = 1; i < size; i++)
{
if(elementData[i] >= elementData[i - 1])
count++;
else
count = 1;
if(count > longest)
longest = count;
}
return longest;
}