Algorithms LIS:Longest Increasing Subsequence in n log n Longest increasing subsequence: the O(n²) best-ending-here table, then patience / tails plus binary search for n log n. Read More →