From:	"A. Sinan Unur" <sinan DOT unur AT cornell DOT edu>
Newsgroups:	comp.os.msdos.djgpp
Subject:	Re: The meaning of O(n)...
Date:	Tue, 20 Jan 1998 14:50:29 -0600
Organization:	Cornell University
Lines:	18
Sender:	asu1 AT cornell DOT edu (Verified)
Message-ID:	<34C50E15.5067@cornell.edu>
References:	<bWLoegW7sFse-pn2-3vfQjsmVfXH4 AT localhost>
Reply-To:	sinan DOT unur AT cornell DOT edu
NNTP-Posting-Host:	128
Mime-Version:	1.0
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp

Gili wrote:
> 
> Hi,
> 
>         I have noticed that lots algorithms provide their efficency as 
> O(n), where N is the number of elements they are operating on. The 
> last math course I have taken is Calculus 2 and I do not recall ever 
> seeing the O(n) function. What does it mean? How efficient is 
> something with O(n)? Thanks in advanced,
> 
> Gili

it means the time the algorithm takes is proportional to the number of
elements it operates on. it is more efficient than O(n^2) ;-) this
discussion is really off-topic. try to search yahoo and alta vista or go
to a library.

  -- Sinan

- Raw text -