Re: Add seq-shuffle

[Adam Porter <adam@alphapapa.net>]

Hi Emanuel,

That's a neat and concise solution.  It seems to produce a decently 
random sorting, but I'd guess that it may not perform well for large 
sequences.  For example:

     (let (comparisons)
       (list :result (seq-sort (lambda (a b)
                                 (push (cons a b) comparisons)
                                 (zerop (random 2)))
                               (number-sequence 0 10))
             :num-comparisons (length comparisons)))
     ;; (:result (6 0 9 1 5 10 8 2 7 3 4) :num-comparisons 26)

In testing that expression repeatedly, I see that the number of 
comparisons varies between about 23 and 26.

Thanks for pointing it out, though.  It's good to know that it exists 
and in what circumstances it could be useful.

--Adam