|
|
|
| There's more than one way to do things | |
| PerlMonks |
Re^2: Puzzle: Longest Increasing Sequenceby jdalbec (Deacon) |
| on Apr 16, 2006 at 21:55 UTC ( [id://543704]=note: print w/replies, xml ) | Need Help?? |
|
Actually, O(n*log(n)**((sqrt(5)-1)/2)) is strictly less than O(n*log(n)). The difference probably won't be noticeable for reasonable values of n, though, since log(n) grows so slowly anyway.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||