Re: can `shuffle-vector' be moved?

[Ted Zlatanov <tzz@lifelogs.com>]

On Fri, 13 May 2011 11:00:10 -0300 Stefan Monnier <monnier@iro.umontreal.ca> wrote: 

>>> (loop
>>> for i from (1-  (length vector)) downto 1
>>> do (rotatef (aref vector i) (aref vector (random i)))))

>> Why is this limited to vectors? with elt it could work also with lists.

SM> Its algorithmic performance on lists would be poor (O(N²)).
SM> You want a different algorithm for lists.

I think the performance would not be bad if the list was put into a
vector, shuffled, then put back--just O(N) with twice the memory usage.
That could be a wrapper around the vector shuffle so it can handle
general sequences.

Ted