In this chapter, we learned how to sort an array to organize all its elements and also how to search elements after the array is sorted. But there are also scenarios where we need to shuffle the values of an array. A common scenario in real life is shuffling a deck of cards.
In the next section, we will learn about the most famous algorithm used to shuffle arrays.
This algorithm was created by Fisher and Yates and popularized by Donald E. Knuth in The Art of Computer Programming book series.
It consists of iterating each position of the array, starting with its last position and swapping the current position with a random position. The random position is lesser than the current position; this way, the algorithm makes sure the positions already shuffled will not be shuffled again (the more we shuffle a deck of cards, the worse is the shuffle).
The following code presents the Fisher-Yates shuffle algorithm:
function shuffle(array) {
for (let i = array...