44 lines
1.4 KiB
C
44 lines
1.4 KiB
C
|
/*
|
|||
|
|
This C program implements Fisher-Yates algorithm for array shuffling. The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set. A variant of the Fisher–Yates shuffle, known as Sattolo’s algorithm, may be used to generate random cycles of length n instead. The Fisher–Yates shuffle is unbiased, so that every permutation is equally likely. The modern version of the algorithm is also rather efficient, requiring only time proportional to the number of items being shuffled and no additional storage space
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
#include <stdio.h>
|
|||
|
|
#include <math.h>
|
|||
|
|
#include <stdlib.h>
|
|||
|
|
|
|||
|
|
|
|||
|
|
static int rand_int(int n)
|
|||
|
|
{
|
|||
|
|
int limit = RAND_MAX - RAND_MAX % n;
|
|||
|
|
int rnd;
|
|||
|
|
do
|
|||
|
|
{
|
|||
|
|
rnd = rand();
|
|||
|
|
}
|
|||
|
|
while (rnd >= limit);
|
|||
|
|
return rnd % n;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
void shuffle(int *array, int n)
|
|||
|
|
{
|
|||
|
|
int i, j, tmp;
|
|||
|
|
for (i = n - 1; i > 0; i--)
|
|||
|
|
{
|
|||
|
|
j = rand_int(i + 1);
|
|||
|
|
tmp = array[j];
|
|||
|
|
array[j] = array[i];
|
|||
|
|
array[i] = tmp;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
int main(void)
|
|||
|
|
{
|
|||
|
|
int i = 0;
|
|||
|
|
int numbers[50];
|
|||
|
|
for (i = 0; i < 50; i++)
|
|||
|
|
numbers[i]= i;
|
|||
|
|
shuffle(numbers, 50);
|
|||
|
|
printf("\nArray after shuffling is: \n");
|
|||
|
|
for ( i = 0; i < 50; i++)
|
|||
|
|
printf("%d\n", numbers[i]);
|
|||
|
|
return 0;
|
|||
|
|
}
|