Python shuffle algorithm performance

Question

I was interested to learn about the time complexity of a shufflefunction in a randomPython library / module . Is it O (n) or is it smaller than this?

Is there a website that shows the time complexity of functions belonging to Python libraries?

Answer 1

You cannot shuffle the list completely randomly less than O (n).

The implementation random.shuffle()uses the Fisher-Yates shuffle algorithm , which is easy to see O (n).