in reply to Re^4: Patience Sorting To Find Longest Increasing Subsequence
in thread Patience Sorting To Find Longest Increasing Subsequence

What is the "it" that is O(N log log N) time though?

From what I understand its both finding the LIS and doing the patience sort. Actually, if i understand things correctly the B&S algorithm actually finds all increasing sequences in O(N log log N).

Also I have an implementation of Patience sorting with backrefs for the LIS that I will post when I get a moment.

---
$world=~s/war/peace/g

  • Comment on Re^5: Patience Sorting To Find Longest Increasing Subsequence

In Section Meditations