Adding functional LargestSubsequence.  My previous strategy turned out to be O(2^n), and was a fundamentally bad idea.  This implementation runs in O(nlogn), bounded by the PriorityQueue heap sort.