[Python-ideas] [Python-Dev] About adding a new iterator methodcalled "shuffled"

[Antoine Pitrou]

Raymond Hettinger <python at ...> writes:
> 
> You can already write:
> 
>        sorted(s, key=lambda x: random())
> 
> But nobody does that.  So you have a good
> indication that the proposed method isn't need.

On the other hand, sorting is O(n.log(n)), which is probably sub-optimal for
shuffling (I don't know how shuffle() is internally implemented, but ISTM that
it shouldn't take more than O(n)).

Note that I'm not supporting the original proposal: shuffle() is not used enough
to warrant such a shortcut.

Regards

Antoine.