Byte order (retitled and silly)
James Johnson
jjhnsn at ut-ngp.UUCP
Fri Apr 18 06:19:23 AEST 1986
> 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 at ngp.cc.utexas.edu jjhnsn at ut-ngp.arpa
UUCP: ihnp4!ut-ngp!jjhnsn allegra!ut-ngp!jjhnsn gatech!ut-ngp!jjhnsn
seismo!ut-sally!jjhnsn harvard!ut-sally!jjhnsn
More information about the Comp.lang.c
mailing list