Newsgroups: comp.lang.c++,comp.sys.mac.programmer.help,comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!news.cs.indiana.edu!news.sgi.com!news.bbnplanet.com!su-news-hub1.bbnplanet.com!news.pbi.net!cbgw3.lucent.com!nntphub.cb.lucent.com!alice!allegra!akalice!ark
From: ark@research.att.com (Andrew Koenig)
Subject: Re: Mergesort: why's it efficient?
Message-ID: <E1y3Ln.Kt0@research.att.com>
Organization: AT&T Research, Murray Hill NJ
References: <6M5-4oabJaB@09.viking.ruhr.com> <E1uDzs.2AI@research.att.com> <ARE.96Dec4135627@laphroig.mch.sni.de>
Date: Thu, 5 Dec 1996 14:44:11 GMT
Lines: 10
Xref: glinda.oz.cs.cmu.edu comp.lang.c++:231812 comp.sys.mac.programmer.help:44623 comp.lang.lisp:24056

In article <ARE.96Dec4135627@laphroig.mch.sni.de> are@laphroig.mch.sni.de writes:

> If you limit N to below a fixed value, then it doesn't make any sense
> to speak about O notation, because that make sense only in the limit:
> to say f(n) = O(g(n)) means lim f(n)/g(n) < c for some constant c.

Actually it does, because you don't necessarily know the value in advance.
-- 
				--Andrew Koenig
				  ark@research.att.com
