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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,68b43b837fb71f2a
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-09-17 03:36:15 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!128.39.3.168!uninett.no!news.net.uni-c.dk!not-for-mail
From: Jacob Sparre Andersen <sparre@nbi.dk>
Newsgroups: comp.lang.ada
Subject: Re: Thoughts on the recent ICFP contest
Date: Tue, 17 Sep 2002 12:36:10 +0200
Organization: UNI-C
Message-ID: <3D87059A.6030305@nbi.dk>
References: <3D7FFD66.9030805@telepath.com>
NNTP-Posting-Host: kaoslx07.nbi.dk
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: news.net.uni-c.dk 1032258972 25102 130.225.212.98 (17 Sep 2002
 10:36:12 GMT)
X-Complaints-To: usenet@news.net.uni-c.dk
NNTP-Posting-Date: Tue, 17 Sep 2002 10:36:12 +0000 (UTC)
User-Agent: Any Browser, HTML 4.01, XHTML 1.0
X-Accept-Language: Faeroese [fo],Danish [da],Norweg.96 20000731 (Red Hat Linux
 7.3 2.96-110)
Xref: archiver1.google.com comp.lang.ada:29065
Date: 2002-09-17T12:36:10+02:00
List-Id: <comp.lang.ada>

Ted Dennison wrote:

> I was reading over the results of this year's ICFP programming contest 
> (http://icfpcontest.cse.ogi.edu/ ) last week.

> One thing I started wondering is what libraries would have been needed 
> to have been available for someone to complete this project 
> competitively in Ada.

You claim our submission isn't competitive? :-)

(I am afraid it isn't)

 > I came up with the following things that would have 
helped an
> Ada implementation get into the lightning round (submitted <24 hours 
> after the requirements were posted):
> 
>   (1) An inference engine.

Maybe.

>   (2) High-level socket bindings.

I think the AdaSockets package is sufficient.

>   (3) A generic implementation of Dijkstra's Algorithm

More important: Knowledge of Dijkstra's Algorithm.

Neither I or my team mate knew Dijkstra's Algorithm (but we 
learned about it after submitting our entry). I implemented 
a simplified version of Dijkstra's Algorithm in only a few 
hours the night after the deadline. :-(

> Anyway, I'm curious what other Ada folks think about all this.

I wish somebody had told me of Dijkstra's Algorithm a few 
weeks ago.

Jacob
-- 
No trees were killed in the sending of this message.
However a large number of electrons were terribly 
inconvenienced.