Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site birtch.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!oliveb!hplabs!felix!birtch!oleg
From: oleg@birtch.UUCP (Oleg Kiselev)
Newsgroups: net.lang
Subject: Re: Re: Efficiency of Languages (and com
Message-ID: <115@birtch.UUCP>
Date: Mon, 11-Nov-85 22:28:13 EST
Article-I.D.: birtch.115
Posted: Mon Nov 11 22:28:13 1985
Date-Received: Thu, 14-Nov-85 00:24:42 EST
References: <841@wdl1.UUCP>
Reply-To: oleg@birtch.UUCP (Oleg Kiselev)
Organization: The Real Estate Conspiracy
Lines: 16
Summary: 

In article <841@wdl1.UUCP> jbn@wdl1.UUCP writes:
>On sorting:
>
>	Consider sorting a set of records numbered 0 to 9999 by
>	providing 10,000 buckets and just putting each record into the
>	right slot as it comes along.  Linear time, right?  In practice,

Uh, that's what they taught us as "radix" sort, no?  And it works only
on a defined set of possible values of the key...
-- 
Disclamer: My employers go to church every Sunday, listen to Country music,
and donate money to GOP. I am just a deviant.
+-------------------------------+ Don't bother, I'll find the door!
| "VIOLATORS WILL BE TOAD!"	|                       Oleg Kiselev. 
|		Dungeon Police	|...!{trwrb|scgvaxd}!felix!birtch!oleg
--------------------------------+...!{ihnp4|randvax}!ucla-cs!uclapic!oac6!oleg