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=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a6b:d405:: with SMTP id
 l5-v6mr2864076iog.70.1526525375867;
        Wed, 16 May 2018 19:49:35 -0700 (PDT)
X-Received: by 2002:a9d:24a1:: with SMTP id z30-v6mr64640ota.4.1526525375571;
 Wed, 16 May 2018 19:49:35 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!feeder3.usenet.farm!feed.usenet.farm!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!v8-v6no377472itc.0!news-out.google.com!b185-v6ni347itb.0!nntp.google.com!u74-v6no372600itb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Wed, 16 May 2018 19:49:35 -0700 (PDT)
In-Reply-To: <aed23075-1271-4e2c-b5f2-8da705e1a73e@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=73.2.251.187;
 posting-account=JSxOkAoAAADa00TJoz2WZ_46XrZCdXeS
NNTP-Posting-Host: 73.2.251.187
References: <6420bab2-0aef-4d36-b978-525e4de45e7e@googlegroups.com>
 <aed23075-1271-4e2c-b5f2-8da705e1a73e@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <a86dc533-a8f5-4d1c-9b4c-11d7963c6d15@googlegroups.com>
Subject: 
 =?UTF-8?Q?Re=3A_meaningfully=2Fcompellingly_=E2=80=9Cadvertising=E2=80=9D_Ada_?=
	=?UTF-8?Q?on_StackOverflow?=
From: John Perry <john.perry@usm.edu>
Injection-Date: Thu, 17 May 2018 02:49:35 +0000
Content-Type: text/plain; charset="UTF-8"
Xref: reader02.eternal-september.org comp.lang.ada:52380
Date: 2018-05-16T19:49:35-07:00
List-Id: <comp.lang.ada>

On Wednesday, May 16, 2018 at 9:46:32 PM UTC-5, John Perry wrote:
> It's quite a simple program: adding and removing ~10^6 nodes to a tree, and testing if the tree has a value.

Argh. I knew as I was typing that that the description wasn't quite right, but I didn't think to correct it. It adds (10^6/3) nodes, attempts to delete (10^6)/3, and tests for a value in the tree (10^6)/3 times. Still, it's relatively simple.