Last active
December 18, 2015 02:48
-
-
Save junaidk/5713447 to your computer and use it in GitHub Desktop.
Shuffle an array
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// C Program to shuffle a given array | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <time.h> | |
// A utility function to swap to integers | |
void swap (int *a, int *b) | |
{ | |
int temp = *a; | |
*a = *b; | |
*b = temp; | |
} | |
// A utility function to print an array | |
void printArray (int arr[], int n) | |
{ | |
for (int i = 0; i < n; i++) | |
printf("%d ", arr[i]); | |
printf("\n"); | |
} | |
// A function to generate a random permutation of arr[] | |
void randomize ( int arr[], int n ) | |
{ | |
// Use a different seed value so that we don't get same | |
// result each time we run this program | |
srand ( time(NULL) ); | |
// Start from the last element and swap one by one. We don't | |
// need to run for the first element that's why i > 0 | |
for (int i = n-1; i > 0; i--) | |
{ | |
// Pick a random index from 0 to i | |
int j = rand() % (i+1); | |
// Swap arr[i] with the element at random index | |
swap(&arr[i], &arr[j]); | |
} | |
} | |
// Driver program to test above function. | |
int main() | |
{ | |
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8}; | |
int n = sizeof(arr)/ sizeof(arr[0]); | |
randomize (arr, n); | |
printArray(arr, n); | |
return 0; | |
} | |
// Source : http://www.geeksforgeeks.org/shuffle-a-given-array/ | |
/* | |
Output: | |
7 8 4 6 3 1 2 5 | |
The above function assumes that rand() generates a random number. | |
Time Complexity: O(n), assuming that the function rand() takes O(1) time. | |
How does this work? | |
The probability that ith element (including the last one) goes to last position is 1/n, because we randomly pick an element in first iteration. | |
The probability that ith element goes to second last position can be proved to be 1/n by dividing it in two cases. | |
Case 1: i = n-1 (index of last element): | |
The probability of last element going to second last position is = (probability that last element doesn't stay at its original position) x (probability that the index picked in previous step is picked again so that the last element is swapped) | |
So the probability = ((n-1)/n) x (1/(n-1)) = 1/n | |
Case 2: 0 < i < n-1 (index of non-last): | |
The probability of ith element going to second position = (probability that ith element is not picked in previous iteration) x (probability that ith element is picked in this iteration) | |
So the probability = ((n-1)/n) x (1/(n-1)) = 1/n | |
We can easily generalize above proof for any other position. | |
*/ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment