There are a few different ways to randomly shuffle the elements of an array in JavaScript. One common method is to use the Fisher-Yates shuffle algorithm. Here is an example of a function that performs a Fisher-Yates shuffle on an array:

function shuffle(arr) {
  for (let i = arr.length - 1; i > 0; i--) {
    let j = Math.floor(Math.random() * (i + 1));
    let temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
  }
  return arr;
}

This function takes an array as an argument and performs a Fisher-Yates shuffle on it. The outer loop starts at the last element of the array and iterates backwards through the array. For each iteration, a random index ‘j’ between ‘0’ and ‘i’ is chosen, and the current element ‘i’ is swapped with the element at index ‘j’. This shuffling process is repeated until all elements have been visited. The function then returns the shuffled array.

Another option is using the sort method with a random number generator

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

This function takes an array as an argument and sorts it using the Array.prototype.sort method and a random number generator that returns either -1, 0 or 1.

Both of the above methods will randomly shuffle the elements of an array in JavaScript.

Also Read:

Categorized in: