From: mert0407 AT sable DOT ox DOT ac DOT uk (George Foot)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: How does it work?
Date: 30 Oct 1997 05:18:10 GMT
Organization: Oxford University, England
Message-ID: <6395ai$3lg$2@news.ox.ac.uk>
References: <878080533 DOT 29493 AT dejanews DOT com> <34586466 DOT 312 AT cs DOT com>
NNTP-Posting-Host: sable.ox.ac.uk
Lines: 16
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

On Thu, 30 Oct 1997 10:41:42 +0000 in comp.os.msdos.djgpp John M. Aldrich (fighteer AT cs DOT com) wrote:
: Hmm... try counting to 2 billion without printing anything out:  
: 
:     int i;
:     for ( i = 0; i < 2000000000; i++ )
:         ;
: 
: Bet that runs faster in DJGPP than in Qbasic.  :)

Can Qbasic count that high? Besides, the optimiser ought to optimise
that out anyway ;).

-- 
Regards,

george DOT foot AT merton DOT oxford DOT ac DOT uk