The longest increasing subsequence problem has a simple and elegant $O(n \log n)$ time solution via patience sorting.Such a basic and well-studied problem, however, should have a number of different solutions, just as sorting does.Are there other distinct $O(n \log n)$ time algorithms for this problem?
Different algorithms for longest increasing subsequence
ds.algorithms;reference request