This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: fix opt/8634

From: Gerald Pfeifer <pfeifer at dbai dot tuwien dot ac dot at>
To: Geoff Keating <geoffk at geoffk dot org>
Cc: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>, gcc-patches at gcc dot gnu dot org
Date: Wed, 9 Apr 2003 06:31:01 +0200 (CEST)
Subject: Re: fix opt/8634
References: <10304072329.AA17096@vlsi1.ultra.nyu.edu><20030407232936.GA32382@atrey.karlin.mff.cuni.cz> <jmfzoshpj8.fsf@desire.geoffk.org>

On Tue, 8 Apr 2003, Geoff Keating wrote:
> If you take a linear operation (that is, O(n)), and then you perform
> it K*n times for some fixed constant K, then the program is O(n*n),
> which is quadratic.

Sorry, but this is certainly not how big-O notation is supposed to work:
O(K·n) = O(n) for any fixed K > 0, by definition.

Gerald
-- 
Gerald "Jerry"   pfeifer at dbai dot tuwien dot ac dot at   http://www.pfeifer.com/gerald/

Follow-Ups:
- Re: fix opt/8634
  - From: Andrew Pinski
- Re: fix opt/8634
  - From: Geoff Keating

References:
- Re: fix opt/8634
  - From: Richard Kenner
- Re: fix opt/8634
  - From: Zdenek Dvorak
- Re: fix opt/8634
  - From: Geoff Keating

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]