In general, though, I'll assume that you meant that in the spirit of saying that there's no a priori way to verify a sorted set that's faster than O(n), and that there's no sentinel token value that exists which would be useful for in all possible input domains using a posteriori validation.
--
[ e d @ h a l l e y . c c ]
In reply to Re^3: Fast way to check if a sort was doen
by halley
in thread Fast way to check if a sort was doen
by Outaspace
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |