Which is the more efficient way to shuffle an array in JavaScript?

Asked Sep 16 '18 at 09:18

Active Sep 16 '18 at 09:18

Viewed 52 times

Algorithm 1:

function shuffle(a) {
    var j, x, i;
    for (i = a.length - 1; i > 0; i--) {
        j = Math.floor(Math.random() * (i + 1));
        x = a[i];
        a[i] = a[j];
        a[j] = x;
    }
    return a;
}

Algorithm 2:

function shuffle(a) {    
  return a.sort(() => 0.5 - Math.random());
}

Please explain your answer!

asked Sep 16 '18 at 09:18

Zali

1

Welcome, take a look at this: https://stackoverflow.com/questions/2450954/how-to-randomize-shuffle-a-javascript-array – Jeto Sep 16 '18 at 09:19
Method 2 is going to change the array...maybe. Not necessarily what I'd call a "shuffle", as the new array is not likely to be very random. – VLAZ Sep 16 '18 at 09:19
1

Use the likes of JSPerf online to have a look at performance differences – andy mccullough Sep 16 '18 at 09:19
please add *your* insights to the question. – Nina Scholz Sep 16 '18 at 09:23

Which is the more efficient way to shuffle an array in JavaScript?

0 Answers0