From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 9 Sep 93 18:53:59 GMT
From: mcsun!sunic!news.lth.se!dag@uunet.uu.net  (Dag Bruck)
Subject: Re: Hoare's gripes about Ada (should be so what)
Message-ID: <26nu47$2nb@nic.lth.se>
List-Id: <comp.lang.ada>

In <comp.lang.ada> dewar@cs.nyu.edu (Robert Dewar) writes:
>How about a small sort contest. Suppose you want to write an Ada sort with
>the spec:
>
>	type x is array (integer range <>) of integer;
>	procedure sort (data : in out x); -- sorts into ascending order
>
>What's the least number of Ada tokens (counting from the IS to the semicolon
>following the END) that implements this spec?

Here's my contribution (appologies for any syntax errors):

	..... IS
	   NULL;
	END;

The implementation is not very correct, but what the heck.

			-- Dag B, C++ programmer :-)