Question: Given a sequence of unordered n integers, S = a1,a2,a3...

Give a formal and recursive definition of the length of the longest non-decreasing subsequence in term of n.

So, my thoughts are that if we're defining it recursively then each integer in the sequence is a sequence of length of 1 and contains a non decreasing sub-sequence of length 1. Would this be the correct way to say this or am I completely off?

Answer: 
The final keyword prevents you from modifying a class if applied to the class, or a method if applied to a method.

From <http://en.wikipedia.org/wiki/Final_%28Java%29> :

> 
> A final method cannot be overridden or hidden by subclasses. This is used to prevent unexpected behavior from a subclass altering a method that may be crucial to the function or consistency of the class.
> 
> 
> 

If you subclass a class with a final method you need to leave that method alone. If the class is final you can't subclass it at all.
Refresh dependencies solved my issue.