From: NOSPAMsl AT psycode DOT com (Gili)
Newsgroups: comp.os.msdos.djgpp
Subject: The meaning of O(n)...
Date: 20 Jan 1998 18:54:07 GMT
Organization: Generation.NET
Lines: 9
Message-ID: <bWLoegW7sFse-pn2-3vfQjsmVfXH4@localhost>
Reply-To: NOSPAMsl AT psycode DOT com
NNTP-Posting-Host: portE04.Generation.NET
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 8bit
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

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