an algorithm question
From: Eitan (no_spam_please_at_nospam.com)
Date: 02/26/05
- Next message: Jym: "Re: an algorithm question"
- Previous message: Yao Ziyuan: "Re: A modified version of minimum spanning tree"
- Next in thread: Jym: "Re: an algorithm question"
- Reply: Jym: "Re: an algorithm question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 27 Feb 2005 00:39:43 +0200
Hello,
Where can I find some good documentation about algorithm ?
For a specific question.
How can I prove that
(teta for latin letter teta - I cannot represent it in the email, so I will
write teta).
max(f(n), g(n)) = teta(f(n) + g(n)).
Thanks :)
- Next message: Jym: "Re: an algorithm question"
- Previous message: Yao Ziyuan: "Re: A modified version of minimum spanning tree"
- Next in thread: Jym: "Re: an algorithm question"
- Reply: Jym: "Re: an algorithm question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]