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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,8de7eedad50552f1
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!postnews.google.com!o13g2000cwo.googlegroups.com!not-for-mail
From: "Isaac Gouy" <igouy@yahoo.com>
Newsgroups: comp.lang.ada
Subject: Re: Ada bench : count words
Date: 23 Mar 2005 09:06:28 -0800
Organization: http://groups.google.com
Message-ID: <1111597588.133515.300300@o13g2000cwo.googlegroups.com>
References: <ur7ib38sg.fsf@obry.net>
   <pan.2005.03.19.16.57.03.525542@linuxchip.demon.co.uk.uk.uk>
   <87vf7n5njs.fsf@code-hal.de>
   <umzsy3c8j.fsf@obry.net>
   <423f5813$0$9224$9b4e6d93@newsread4.arcor-online.net>
   <mailman.47.1111454204.23655.comp.lang.ada@ada-france.org>
   <18arnvu705ly4$.1wz6ybz1jt70y$.dlg@40tude.net>
NNTP-Posting-Host: 12.65.97.151
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1111597592 19290 127.0.0.1 (23 Mar 2005 17:06:32
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Wed, 23 Mar 2005 17:06:32 +0000 (UTC)
In-Reply-To: <18arnvu705ly4$.1wz6ybz1jt70y$.dlg@40tude.net>
User-Agent: G2/0.2
Complaints-To: groups-abuse@google.com
Injection-Info: o13g2000cwo.googlegroups.com; posting-host=12.65.97.151;
   posting-account=7DGySgwAAADWW5O_600A0X4F7Tvs4mwJ
Xref: g2news1.google.com comp.lang.ada:9809
Date: 2005-03-23T09:06:28-08:00
List-Id: <comp.lang.ada>

Dmitry A. Kazakov wrote:
-snip-
> P.S. For word frequencies: gcc version uses hash + sort. I wonder if
binary
> trees could be better here. Or even sorted arrays for simplicity,
there is
> no item deletion, search is more often than insert... Of course, for
tree
> node allocation one could use a stack pool instead of heap.
>
> (That's one of the weaknesses of this contest. Actually the method
should
> have been specified)

Yes, that's one of the more glaring weaknesses.

(It's mostly laziness and jaundiced experience.)