Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

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

Replies are listed 'Best First'.
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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://543704]
Happy-the-monk hands LanX a treat of ambidextrosis.
[Discipulus]: my son was used to say being left-handed on both hands..

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (5)
As of 2018-02-19 12:13 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (264 votes). Check out past polls.