CareerCup

We can shuffle it by the donald knuth's shuffle algo.
Time complexity will be O(n lg n).
Possible Test case is that we are not shuffling the number out of array boundary.
Hope the samedesign work for casino too.

#include<stdio.h>
#include<stdlib.h>

int main()
{
int array[52];
int i, temp;
int temp2;

for(i=0;i<52;i++)
array[i] = i;

for(i=0;i<52;i++)
{
temp = random()%51;
temp2 = array[i];
array[i] = array[temp];
array[temp] = temp2;
}

printf("\n Shuffled Array is");

for(i=0;i<52;i++)
{
printf("%d",array[i]);
printf("\n");
}

return 0;

}

Shuffling algorithms

In a computer, shuffling is equivalent to generating a random permutation of the cards. There are two basic algorithms for doing this, both popularized by Donald Knuth. The first is simply to assign a random number to each card, and then to sort the cards in order of their random numbers. This will generate a random permutation, unless two of the random numbers generated are the same. This can be eliminated either by retrying these cases, or reduced to an arbitrarily low probability by choosing a sufficiently wide range of random number choices.

The second, generally known as the Knuth shuffle or Fisher-Yates shuffle, is a linear-time algorithm (as opposed to the previous O(n log n) algorithm if using efficient sorting such as mergesort or heapsort) which involves moving through the pack from top to bottom, swapping each card in turn with another card from a random position in the part of the pack that has not yet been passed through (including itself). Providing that the random numbers are unbiased, this will always generate a random permutation.