欧美bbbwbbbw肥妇,免费乱码人妻系列日韩,一级黄片

C#實(shí)現(xiàn)洗牌算法

 更新時(shí)間：2015年03月23日 11:25:43   投稿：hebedich  
洗牌算法的要求是這樣的:將N個(gè)數(shù)亂序后輸出.由于和撲克牌的洗牌過(guò)程比較相似所以我也就稱(chēng)為洗牌算法了.很多地方都不自覺(jué)的需要這個(gè)算法的支持.也可以將這個(gè)算法擴(kuò)展為從N個(gè)數(shù)中取出M個(gè)不重復(fù)的數(shù)(0<M<=N).今天我們看下如何用C#來(lái)實(shí)現(xiàn)

C#洗牌算法，簡(jiǎn)單演示！

算法一、

/// <summary>
/// 洗牌算法
/// </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("第" + (i + 1) + "張牌是：" + iCards[i] + "<br/>");
 }
}

算法二、

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 };
   //創(chuàng)建一個(gè)臨時(shí)的撲克牌組
   int[] newCards = new Card[54];
   //bool變量數(shù)組
   bool[] assigned = new bool[54];

   Random sourceGen = new Random();
   for (int i = 0; i < 54; i++)
   {
    int destCard = 0;     //隨機(jī)數(shù)保存空間
    bool foundCard = false;
    while (foundCard == false)
    {
     //生成一個(gè)0到54之間的隨機(jī)數(shù)
     destCard = sourceGen.Next(54);
     if (assigned[destCard] == false)
     {
      foundCard = true;
     }
    }
    assigned[destCard] = true;
    newcards[destCard] = cards[i];
   }

算法三、

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

相比一下，第三個(gè)更簡(jiǎn)單，更高效！

以上就是本文給大家分享的洗牌算法的全部?jī)?nèi)容了，希望大家能夠喜歡。

相關(guān)文章

最新評(píng)論