From: E. Gladyshev (egladysh_at_[hidden])
Date: 2003-10-08 16:44:19
--- David Abrahams <dave_at_[hidden]> wrote:
> Please consult any basic textbook on algorithm complexity. No offense
> intended, but if we can't agree on O(N) == O(k * N), I think we'll
> never agree on anything and I don't see any point in continuing this
Of course I are right, I was just teasing sorry.
You were paranoid about me using word "behavior"
I was paranoid about 'k'; technically you should
have said that k is *independent* of N.
I liked your "o-n-squared-equals-o-one-ly" proof though.
I think you and I agree that variant
should not have a special "first-type switch"?
Do you Yahoo!?
The New Yahoo! Shopping - with improved product search
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk