How to write a sorting program that will sort everything?

[Boyd Roberts]

In article <3418 at inews.intel.com> bhoughto at 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 at necisa.ho.necisa.oz.au

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