Boris Borcic wrote: > does > > x.sort(cmp = lambda x,y : cmp(random.random(),0.5)) > > pick a random shuffle of x with uniform distribution ? > > Intuitively, assuming list.sort() does a minimal number of comparisons to > achieve the sort, I'd say the answer is yes. But I don't feel quite > confortable > with the intuition... can anyone think of a more solid argumentation ?
Why not use the supplied shuffle method? random.shuffle(x) -- http://mail.python.org/mailman/listinfo/python-list
