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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,88a843cdd1eb738a
X-Google-Attributes: gid103376,public
From: Gautier <gautier.demontmollin@maths.unine.ch>
Subject: Re: Language Challenge 2000
Date: 2000/02/04
Message-ID: <389AB13D.42D3C1C1@maths.unine.ch>#1/1
X-Deja-AN: 581457257
Content-Transfer-Encoding: 7bit
References: <38964D82.3423805@sdynamix.com>
To: bvoh@sdynamix.com
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
X-Trace: 4 Feb 2000 10:58:52 +0100, 130.125.13.32
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Date: 2000-02-04T00:00:00+00:00
List-Id: <comp.lang.ada>

> Criteria:

>         a)  Execution time
>         b)  Size of executable

Let me allow a remark: your b) criterium is a bit ridiculous!
In effect, the size of code for solving your problem
will be so small that the .exe size will essentially contain
the fixed library overhead, that doesn't grow with the program!
It depends on the system, the compiler system (e.g. gcc).
In addition one can compress the .exe with UPX, keep or not
keep the debug info, etc.

According to the weight of b) in your decision only assembler
could win your challenge!

-- 
Gautier

_____\\________________\_______\
http://members.xoom.com/gdemont/