Randomly Shuffling an Array in C

Shuffling an array is a common operation in programming, used in various scenarios such as randomization, data processing, and game development. In this article, we will explore different methods to randomly shuffle an array in C, providing code examples and explanations for each approach.

Fisher-Yates Shuffle Algorithm

The Fisher-Yates shuffle algorithm is a widely used method for shuffling an array. It iterates through the array and swaps each element with a randomly selected element from the remaining part of the array.

void fisher_yates_shuffle(int* array, int size) {
  for (int i = 0; i < size - 1; i++) {
    // Generate a random index between i and size - 1
    int j = i + rand() % (size - i);

    // Swap the elements at indices i and j
    int temp = array[i];
    array[i] = array[j];
    array[j] = temp;
  }
}
  

Durstenfeld Shuffle Algorithm

The Durstenfeld shuffle algorithm is another efficient method for array shuffling. It works by repeatedly swapping each element with a random element from the remaining array.

void durstenfeld_shuffle(int* array, int size) {
  for (int i = 0; i < size - 1; i++) {
    // Generate a random index between i and size - 1
    int j = i + rand() % (size - i);

    // Swap the elements at indices i and j
    int temp = array[i];
    array[i] = array[j];
    array[j] = temp;
  }
}
  

Knuth Shuffle Algorithm

The Knuth shuffle algorithm is a more complex but efficient method for shuffling large arrays. It uses a random permutation of the array indices to determine the new order of the elements.

void knuth_shuffle(int* array, int size) {
  // Create an array of indices
  int indices[size];
  for (int i = 0; i < size; i++) {
    indices[i] = i;
  }

  // Shuffle the indices using Fisher-Yates algorithm
  fisher_yates_shuffle(indices, size);

  // Rearrange the original array based on the shuffled indices
  int shuffled_array[size];
  for (int i = 0; i < size; i++) {
    shuffled_array[i] = array[indices[i]];
  }
}
  

Conclusion

In this article, we have discussed three different methods for randomly shuffling an array in C: Fisher-Yates, Durstenfeld, and Knuth. Each method offers its own advantages and efficiency characteristics, depending on the size of the array and the desired performance.

Also Read: Where Does Fatty Acid Oxidation Occur

Recommend: What Is The Main Form Of Mechanical Digestion

Related Posts: How To Read A Micrometer Caliper

Also Read: How Do I Know If I Have Sphenoid Sinusitis

Recommend: Where Did Mardi Gras Originate