Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^2: Puzzle: Longest Increasing Sequence

by jdalbec (Deacon)
on Apr 16, 2006 at 21:55 UTC ( #543704=note: print w/ replies, xml ) Need Help??


in reply to Re: Puzzle: Longest Increasing Sequence
in thread Puzzle: Longest Increasing Sequence

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.


Comment on Re^2: Puzzle: Longest Increasing Sequence
Re^3: Puzzle: Longest Increasing Sequence
by ikegami (Pope) on Apr 16, 2006 at 22:30 UTC
    oh yeah. I thought it was *, not **

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://543704]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2014-07-30 12:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (231 votes), past polls