It's sort of like stating the runtime efficiency of a Bogosort; the runtime efficiency is unbounded. Theoretically any list could be sorted on the first run, but it could also just keep sorting in an unbounded fashion for forever, though given enough time (which could be tens of trillions of years or longer), it will eventually be sorted if we assume regular distribution of random numbers.
ETA:
Ok, I read through the actual paper, and it's clearly meant more as a joke, which I don't think was made clear in this article: https://www.sciencedirect.com/science/article/pii/S277318632...