|
|
|
| The stupid question is the question not asked | |
| PerlMonks |
Re^5: Patience Sorting To Find Longest Increasing Subsequenceby demerphq (Chancellor) |
| on May 07, 2006 at 19:10 UTC ( [id://547923]=note: print w/replies, xml ) | Need Help?? |
|
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
In Section
Meditations
|
|
||||||||||||||||||||||