How to randomly partition a list into n nearly equal parts?

Question

I have read the answers to the Slicing a list into n nearly-equal-length partitions [duplicate] question.

This is the accepted answer:

def partition(lst, n):      division = len(lst) / float(n)      return [ lst[int(round(division * i)): int(round(division * (i + 1)))] for i in xrange(n) ] 

I am wondering, how does one modify these solutions in order to randomly assign items to a partition as opposed to incremental assignment.

Answer 1

Call random.shuffle() on the list before partitioning it.