corejava-array: Print the length of largest consecutive ascending sequence of integers in array

You shouldn´t have to use a temporary list for this. Just loop through the array or list with a counter and increment for each element that is greater than or equal to the previous. Use another variable to store the maximum:

LargestSeqArray.java:
------------------------------------------------------------
class LargestSeqArray{
public static void main(String s1[]){
int[] a = { 12, 121, 13, 14, 10, 11, 14, 16, 20, 22, 32, 34, 21 };

int count = 1, max = 1;

for (int i = 1; i < a.length; i++) {
if (a[i] >= a[i - 1]) {
count++;
} else {
if (count > max) {
max = count;
}
count = 1;
}
}

System.out.println(max);
}
}


Here, count is the number of contiguous and sorted elements. We increment it while we´re on a continuous/increasing streak. Once this streak breaks (else clause), we check if count is greater than max, our variable for storing the maximum count: if it is, we set max to count. We then set count back to 1, since in the else clause we know our streak has ended and we´ll need to start over.