On the complexity order of algorithms (was: Re: AMD64 X2 questions)
On Aug 24 2007, Chris Ahlstrom wrote:
> I found this recent article (by a Microsoft guy!) in Dr. Dobbs to be
> interesting:
>
> http://www.ddj.com/hpc-high-performance-computing/201202924
(...)
> * Comparing O(1) and O(K)
Ugh! This article just shows that the Microsoft people should take some
classes in theoretical computer science, as O(1) is the very same thing
for O(K), if K is a constant.
Regards, Rogério Brito.
--
Rogério Brito : rbrito@{mackenzie,ime.usp}.br : GPG key 1024D/7C2CAEB8
http://www.ime.usp.br/~rbrito : http://meusite.mackenzie.com.br/rbrito
Projects: algorithms.berlios.de : lame.sf.net : vrms.alioth.debian.org
Reply to: