算法思路
step1:首先我们有一个已经排好序的数组:
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
---|
step2:依次从最后一位往前替换,先用 random()*(i+1) % (i+1) 随机函数生成一个 [0-i] 范围的整数,即为跟第 i 位交换的数组下标
step3:依次执行前两个步骤替换剩下的值
C++代码
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
int a[10] = {0,1,2,3,4,5,6,7,8,9};
int main(){
for (int i = 9; i > 0; i--){
srand((unsigned int)(time(NULL)));
//产生[a,b]范围的随机整数公式(rand() % (b-a+1)) + a
int index = (rand() % (i+1)) % (i + 1); //[0,i]的范围选出index
int temp = a[i];
a[i] = a[index];
a[index] = temp;
}
for (int i = 0; i < 10; i++){
printf("%d ",a[i]);
}
printf("\n");
return 0;
}
Java代码
import java.util.Random;
public class Test{
public static void shuffle(int[] a){
int m = a.length-1;
Random rnd = new Random();
for (int i = m; i > 0; i--){
int index = Math.abs(rnd.nextInt() % (i+1));
int temp = a[i];
a[i] = a[index];
a[index] = temp;
}
}
public static void arrayPrint(int[] a){
for (int i = 0; i < a.length; i++){
System.out.print(a[i]+" ");
}
System.out.println();
}
public static void main(String[] args){
int[] a = {0,1,2,3,4,5,6,7,8,9};
shuffle(a);
arrayPrint(a);
}
}
总结
Fisher–Yates shuffle洗牌算法可以做到理论上的完全乱序,Fisher–Yates shuffle 算法是一个非常高效又公平的随机排序算法,如果有随机排序数组的需求,用这个就对了!