Depends on what you mean by "quick"; and it also depends on how you define "comparison operators". You *could* use the spaceship operator ( '<=>' )and sort the list of numbers. That involves, of course, a comparison. You could convert all the values into strings, with leading zeroes sufficient to ensure all the numbers have the same number of digits before the decimal point; then sort as before; this sort uses an implicit comparison. I'm not sure how quick these sorts would be.
The question that seems more important is why you would want to perform a comparison task, without using operators that are wholly appropriate for that purpose. Unless you meant, not having to use the '=', '>' and '<' operators separately...
In reply to Re: max of N numbers?
by spiritway
in thread max of N numbers?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |