Write a method longestSortedSequence that returns the length of the longest sort

Question

Write a method longestSortedSequence that returns the length of the longest sorted sequence within a list of integers. For example, if a variable called list stores the following sequence of values: [1, 3, 5, 2, 9, 7, -3, 0, 42, 308, 17] then the call: list.longestSortedSequence() would return the value 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 non-empty list the method will always return a value of at least 1 because any individual element constitutes a sorted sequence. Assume you are adding to the ArrayIntList class with following fields: public class ArrayIntList { private int[] elementData; private int size; // your code goes here }

Explanation / Answer

int longestSortedSequence(){ int longest=1; int current=1; if(size==0){return 0;} for(int i=1;ielementData[i-1]){ current++; } else{ if(current>longest){longest=current;} current=1;//reset current } }//end for return longest; }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.