Yes, but that's not what he says. He says "The loop will repeat on average n! times". That's not true. He's not referring to O notation there, he brings that in later. Here he's talking about the imperative number of…
You say it will take on average n! attempts to find a sorted list randomly. This is false. It will take on average n!/2 attempts.
Why be cruel to designers with your silly joke?
Yes, but that's not what he says. He says "The loop will repeat on average n! times". That's not true. He's not referring to O notation there, he brings that in later. Here he's talking about the imperative number of…
You say it will take on average n! attempts to find a sorted list randomly. This is false. It will take on average n!/2 attempts.
Why be cruel to designers with your silly joke?