In <[EMAIL PROTECTED]>, on
03/10/2008
at 09:33 AM, "Blaicher, Chris" <[EMAIL PROTECTED]> said:
>In this context, sorting and the exponential nature of it, it would have
>been better to use a log base 2 example, rather than a natural log
>example.
When talking about the complexity of an algorithm, it's usually the rate
of growth that matters. Expressing it in terms of log2 rather than ln just
changes the multiplicative constant.
OTOH, the difference between N**2 and N log N is relevant.
--
Shmuel (Seymour J.) Metz, SysProg and JOAT
ISO position; see <http://patriot.net/~shmuel/resume/brief.html>
We don't care. We don't have to care, we're Congress.
(S877: The Shut up and Eat Your spam act of 2003)
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
