What Is The Difference Between Random.sample And Random.shuffle In Python

I have a list a_tot with 1500 elements and I would like to divide this list into two lists in a random way. List a_1 would have 1300 and list a_2 would have 200 elements. My questi

Solution 1:

The source for shuffle:

defshuffle(self, x, random=None, int=int):
    """x, random=random.random -> shuffle list x in place; return None.

    Optional arg random is a 0-argument function returning a random
    float in [0.0, 1.0); by default, the standard random.random.
    """if random isNone:
        random = self.random
    for i inreversed(xrange(1, len(x))):
        # pick an element in x[:i+1] with which to exchange x[i]
        j = int(random() * (i+1))
        x[i], x[j] = x[j], x[i]

The source for sample:

defsample(self, population, k):
    """Chooses k unique random elements from a population sequence.

    Returns a new list containing elements from the population while
    leaving the original population unchanged.  The resulting list is
    in selection order so that all sub-slices will also be valid random
    samples.  This allows raffle winners (the sample) to be partitioned
    into grand prize and second place winners (the subslices).

    Members of the population need not be hashable or unique.  If the
    population contains repeats, then each occurrence is a possible
    selection in the sample.

    To choose a sample in a range of integers, use xrange as an argument.
    This is especially fast and space efficient for sampling from a
    large population:   sample(xrange(10000000), 60)
    """# XXX Although the documentation says `population` is "a sequence",# XXX attempts are made to cater to any iterable with a __len__# XXX method.  This has had mixed success.  Examples from both# XXX sides:  sets work fine, and should become officially supported;# XXX dicts are much harder, and have failed in various subtle# XXX ways across attempts.  Support for mapping types should probably# XXX be dropped (and users should pass mapping.keys() or .values()# XXX explicitly).# Sampling without replacement entails tracking either potential# selections (the pool) in a list or previous selections in a set.# When the number of selections is small compared to the# population, then tracking selections is efficient, requiring# only a small set and an occasional reselection.  For# a larger number of selections, the pool tracking method is# preferred since the list takes less space than the# set and it doesn't suffer from frequent reselections.

    n = len(population)
    ifnot0 <= k <= n:
        raise ValueError, "sample larger than population"
    random = self.random
    _int = int
    result = [None] * k
    setsize = 21# size of a small set minus size of an empty listif k > 5:
        setsize += 4 ** _ceil(_log(k * 3, 4)) # table size for big setsif n <= setsize orhasattr(population, "keys"):
        # An n-length list is smaller than a k-length set, or this is a# mapping type so the other algorithm wouldn't work.
        pool = list(population)
        for i in xrange(k):         # invariant:  non-selected at [0,n-i)
            j = _int(random() * (n-i))
            result[i] = pool[j]
            pool[j] = pool[n-i-1]   # move non-selected item into vacancyelse:
        try:
            selected = set()
            selected_add = selected.add
            for i in xrange(k):
                j = _int(random() * n)
                while j in selected:
                    j = _int(random() * n)
                selected_add(j)
                result[i] = population[j]
        except (TypeError, KeyError):   # handle (at least) setsifisinstance(population, list):
                raisereturn self.sample(tuple(population), k)
    return result

As you can see, in both cases, the randomization is essentially done by the line int(random() * n). So, the underlying algorithm is essentially the same.

Solution 2:

random.shuffle() shuffles the given list in-place. Its length stays the same.

random.sample() picks n items out of the given sequence without replacement (which also might be a tuple or whatever, as long as it has a __len__()) and returns them in randomized order.

Solution 3:

There are two major differences between shuffle() and sample():

1) Shuffle will alter data in-place, so its input must be a mutable sequence. In contrast, sample produces a new list and its input can be much more varied (tuple, string, xrange, bytearray, set, etc).

2) Sample lets you potentially do less work (i.e. a partial shuffle).

It is interesting to show the conceptual relationships between the two by demonstrating that is would have been possible to implement shuffle() in terms of sample():

def shuffle(p):
   p[:] = sample(p, len(p))

Or vice-versa, implementing sample() in terms of shuffle():

defsample(p, k):
   p = list(p)
   shuffle(p)
   return p[:k]

Neither of these are as efficient at the real implementation of shuffle() and sample() but it does show their conceptual relationships.

Solution 4:

I think they are quite the same, except that one updated the original list, one use (read only) it. No differences in quality.

Solution 5:

The randomization should be just as good with both option. I'd say go with shuffle, because it's more immediately clear to the reader what it does.