So providing a faster sort would be a violation?
The standard doesn't seem to say "or better" here, but I know that in other places it does (or least used to say something similar).
The standard doesn't seem to say "or better" here, but I know that in other places it does (or least used to say something similar).
Note that this wouldn't be true if the standard said that it has to be Θ(n log n).
If something is O(1) it's also O(n) and O(n!), since it's an upper bound.