Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site cbdkc1.UUCP
Path: utzoo!watmath!clyde!cbosgd!cbdkc1!ask
From: ask@cbdkc1.UUCP (A.S. Kamlet)
Newsgroups: net.puzzle
Subject: Re: Arranging Numbers
Message-ID: <1155@cbdkc1.UUCP>
Date: Sat, 28-Sep-85 23:19:20 EDT
Article-I.D.: cbdkc1.1155
Posted: Sat Sep 28 23:19:20 1985
Date-Received: Mon, 30-Sep-85 00:43:06 EDT
References: <6550001@acf4.UUCP>
Reply-To: ask@cbdkc1.UUCP (A.S. Kamlet)
Followup-To: <976@oddjob.UUCP>
Distribution: na
Organization: AT&T Bell Laboratories, Columbus
Lines: 16


>I won't spoil the question, I'll just add on an extra-credit section ...
>
>In article <6550001@acf4.UUCP> odom@acf4.UUCP (Paul R. Odom) writes:
>>
>>Identify the sequencing algorithm for this list of numbers:
>>
>>        8, 5, 4, 9, 1, 7, 6, 10, 3, 2
>
>If *all* integers are sorted by this method, which comes first?
>Which comes last?

	8, ... , 0      (I can name the second number, but not the
			 second from the last)
-- 
Art Kamlet  AT&T Bell Laboratories  Columbus {ihnp4 | cbosgd}!cbrma!ask


Brought to you by Super Global Mega Corp .com