From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: ***
X-Spam-Status: No, score=3.8 required=5.0 tests=BAYES_00,INVALID_MSGID,
	RATWARE_MS_HASH,RATWARE_OUTLOOK_NONAME autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fc89c,97188312486d4578
X-Google-Attributes: gidfc89c,public
X-Google-Thread: 1014db,6154de2e240de72a
X-Google-Attributes: gid1014db,public
X-Google-Thread: 109fba,baaf5f793d03d420
X-Google-Attributes: gid109fba,public
X-Google-Thread: 103376,97188312486d4578
X-Google-Attributes: gid103376,public
From: "Dann Corbit" <a-cnadc@microsoft.com>
Subject: Re: Teaching sorts [was Re: What's the best language to start with?]
Date: 1996/08/22
Message-ID: <01bb8fbf$3c21e380$2bac399d@v-cnadc1>#1/1
X-Deja-AN: 175571606
references: <DwGoHq.6n7@cwi.nl>
 <01bb8f1b$ce59c820$32ee6fce@timhome2><TANMOY.96Aug21083507@qcd.lanl.gov>
 <4vfk6b$i6h@krusty.irvine.com> <TANMOY.96Aug21164211@qcd.lanl.gov>
organization: Microsoft Corporation
newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada
Date: 1996-08-22T00:00:00+00:00
List-Id: <comp.lang.ada>




Tanmoy Bhattacharya <tanmoy@qcd.lanl.gov> wrote in article
<TANMOY.96Aug21164211@qcd.lanl.gov>...
{snips}
> The (1) above is obviously rigorous.
{1 from above}
> AB:  >  1) there exists k and N depending on k such that for all n > N,
the
> AB:  >     function in question is bounded in absolute value by by k
|f(n)|. 

Shouldn't that read:
1) there exists k and N and C depending on k such that for all n > N, 
    the function in question is bounded in absolute value by by k |f(n)| +
C
    where C is some numeric constant.
?
Functions may call some start up routines, etc, so that the line never 
passes through the origin.