From b9c48ca8f33e63549f51edb08bd50cc6cc8badbb Mon Sep 17 00:00:00 2001 From: Niklas Haas Date: Sun, 20 Mar 2016 18:17:34 +0100 Subject: playlist: improve shuffle algorithm The old algorithm produced results which were not uniformly distributed, i.e. some particular shuffles were preferred over others. The new algorithm is an implementation of the Fisher-Yates shuffle which is guaranteed to shuffle uniformly given a sufficiently uniform rand() and ignoring potential floating-point errors. Signed-off-by: wm4 --- common/playlist.c | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) (limited to 'common') diff --git a/common/playlist.c b/common/playlist.c index 4c003c5f21..b2b297d671 100644 --- a/common/playlist.c +++ b/common/playlist.c @@ -169,11 +169,9 @@ void playlist_shuffle(struct playlist *pl) arr[n] = pl->first; playlist_unlink(pl, pl->first); } - for (int n = 0; n < count; n++) { - int other = (int)((double)(count) * rand() / (RAND_MAX + 1.0)); - struct playlist_entry *tmp = arr[n]; - arr[n] = arr[other]; - arr[other] = tmp; + for (int n = 0; n < count - 1; n++) { + int j = (int)((double)(count - n) * rand() / (RAND_MAX + 1.0)); + MPSWAP(struct playlist_entry *, arr[n], arr[n + j]); } for (int n = 0; n < count; n++) playlist_add(pl, arr[n]); -- cgit v1.2.3