【编程题】
给定一个数组,设计一个既高效又公平的方法随机打乱这个数组。
import java.util.Random;
import java.util.Scanner;
public class Main {
static Random random = new Random();
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int count = sc.nextInt();
int number[] = new int[count];
for(int i = 0; i < count; i++)
{
number[i] = sc.nextInt();
}
for(int j = number.length-1; j > 1; j--)
{
shuffe(number,j);
}
for(int i = 0; i < number.length; i++)
{
System.out.println(number[i]);
}
}
public static void shuffe(int[] b,int w)
{
swap(b,w,random.nextInt(w));
}
public static void swap(int[] a, int i, int j)
{
int temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
public class Test2 {