Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!cmcl2!seismo!ut-sally!ut-ngp!jjhnsn
From: jjhnsn@ut-ngp.UUCP (James Johnson)
Newsgroups: net.lang.c
Subject: Re: Byte order (retitled and silly)
Message-ID: <3253@ut-ngp.UUCP>
Date: Thu, 17-Apr-86 15:19:23 EST
Article-I.D.: ut-ngp.3253
Posted: Thu Apr 17 15:19:23 1986
Date-Received: Sat, 19-Apr-86 14:15:41 EST
References: <7046@cca.UUCP>
Organization: Univ. of Texas on the Gallium Arsenide Escarpment
Lines: 12

> 	Consider the following problem.  You have an array of 4 byte
> integers.  If you sort the array numerically you get one result.  If
> you regard the bytes as characters and sort them lexicographically on
> a little endian machine you get a different result.

WOW! You mean big endian machines are optimized to sort lists of
four-letter-words ? :-)
--
James Lee Johnson, UTexas Computation Center, Austin, Texas 78712
ARPA:  jjhnsn@ngp.cc.utexas.edu     jjhnsn@ut-ngp.arpa
UUCP:  ihnp4!ut-ngp!jjhnsn  allegra!ut-ngp!jjhnsn  gatech!ut-ngp!jjhnsn
       seismo!ut-sally!jjhnsn  harvard!ut-sally!jjhnsn