Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!uwm.edu!spool.mu.edu!munnari.oz.au!metro!cluster!necisa!boyd
From: boyd@necisa.ho.necisa.oz.au (Boyd Roberts)
Newsgroups: comp.lang.c
Subject: Re: How to write a sorting program that will sort everything?
Message-ID: <2052@necisa.ho.necisa.oz.au>
Date: 27 Mar 91 06:05:54 GMT
References: <1991Mar22.005700.17663@minyos.xx.rmit.oz.au> <3403@inews.intel.com> <1991Mar23.164807.7318@helios.physics.utoronto.ca> <3418@inews.intel.com>
Organization: NEC Information Systems Australia Pty. Ltd.
Lines: 24

In article <3418@inews.intel.com> bhoughto@nevin.intel.com (Blair P. Houghton) writes:
>
>It still doesn't solve the problem of "sorting any data
>type", since that problem is impossible to solve (I.e., you
>have to know in advance the types that may be passed, which
>necessarily omits those types you do not know and which
>are, by the definition of the word "any", part of the set
>"any data type").


Damn right.

So how are going to sort strudels?  Define the pastry comparison operator.

Which has precedence?  Sweet or savory?

Is there a native comparison operator that I can use with a #pragma?

Remember:  Strudels are tricky.


Boyd Roberts			boyd@necisa.ho.necisa.oz.au

``When the going gets wierd, the weird turn pro...''