How to realize the shuffling algorithm on Mini Program

This article introduces the relevant knowledge of "how to realize shuffling algorithm for Mini programs." In the operation process of actual cases, many people will encounter such difficulties. Next, let Xiaobian lead you to learn how to deal with these situations! I hope you can read carefully and learn something!

shuffling algorithm

The Fisher-Yates shuffle algorithm was proposed by Ronald Fisher and Frank Yates in 1938 and adapted for computer programming by Richard Durstenfeld in 1964.

This algorithm is very powerful but easy to understand, the popular explanation is: the last number and any n-1 number in front of a number to exchange, and then the penultimate number and any n-2 number in front of a number to exchange.

Mini programs for (var i = this.rowCount * this.colCount - 1; i >= 0 ; i--){

var iX = parseInt(i / this.colCount);

var iY = i % this.colCount;

var randNumber = this.rangeRandom(0, i + 1);

var randX = parseInt(randNumber / this.colCount);

var randY = randNumber % this.colCount;

//swap two positions

var temp = tmpMineMap[iX][iY];

tmpMineMap[iX][iY] = tmpMineMap[randX][randY];

tmpMineMap[randX][randY] = temp;

}

Mini programs to achieve the effect of "Mini programs how to achieve shuffling algorithm" content introduced here, thank you for reading. If you want to know more about industry-related knowledge, you can pay attention to the website. Xiaobian will output more high-quality practical articles for everyone!