C implements the shuffling algorithm

C# shuffle algorithm, simple demonstration!

Algorithm 1.

/// <summary>
///  Shuffle algorithm 
/// </summary>
private void test()
{
 int[] iCards = new int[54];
 for (int i = 0; i < iCards.Length; i++)
 {
 iCards[i] = i + 1;
 }
 //
 Random rand = new Random();
 int iTarget = 0, iCardTemp = 0;
 for (int i = 0; i < iCards.Length; i++)
 {
 iTarget = rand.Next(0, iCards.Length);
 iCardTemp = iCards[i];
 iCards[i] = iCards[iTarget];
 iCards[iTarget] = iCardTemp;
 }
 
 for (int i = 0; i < iCards.Length; i++)
 {
 Response.Write(" The first " + (i + 1) + " Card is: " + iCards[i] + "<br/>");
 }
}

Algorithm 2.

public void Shuffle()
  {
   
   int[] cards = new int[54] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53 };
   // create 1 A temporary deck of playing cards 
   int[] newCards = new Card[54];
   //bool An array variable 
   bool[] assigned = new bool[54];

   Random sourceGen = new Random();
   for (int i = 0; i < 54; i++)
   {
    int destCard = 0;     // Random number storage space 
    bool foundCard = false;
    while (foundCard == false)
    {
     // generate 1 a 0 to 54 Between random numbers 
     destCard = sourceGen.Next(54);
     if (assigned[destCard] == false)
     {
      foundCard = true;
     }
    }
    assigned[destCard] = true;
    newcards[destCard] = cards[i];
   }

Algorithm 3.

public void Reshuffle()
  {
   int[] cards = new int[54] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53 };
   Random ram = new Random();
   int currentIndex;
   int tempValue;
   for (int i = 0; i < 54; i++)
   {
    currentIndex = ram.Next(0, 54 - i);
    tempValue = cards[currentIndex];
    cards[currentIndex] = cards[53 - i];
    cards[53 - i] = tempValue;
   }
  }

15

The third one is simpler and more efficient than the first one!

The above is this article to share the shuffling algorithm of all the content, I hope you can like.