Re^2: Puzzle: Longest Increasing Sequence

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 (Patriarch) on Apr 16, 2006 at 22:30 UTC
oh yeah. I thought it was , not *	[reply]

In Section Seekers of Perl Wisdom