C#实现洗牌算法
更新时间:2015年03月23日 11:25:43 投稿:hebedich
洗牌算法的要求是这样的:将N个数乱序后输出.由于和扑克牌的洗牌过程比较相似所以我也就称为洗牌算法了.很多地方都不自觉的需要这个算法的支持.也可以将这个算法扩展为从N个数中取出M个不重复的数(0<M<=N).今天我们看下如何用C#来实现
C#洗牌算法,简单演示!
算法一、
/// <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 }; //创建一个临时的扑克牌组 int[] newCards = new Card[54]; //bool变量数组 bool[] assigned = new bool[54]; Random sourceGen = new Random(); for (int i = 0; i < 54; i++) { int destCard = 0; //随机数保存空间 bool foundCard = false; while (foundCard == false) { //生成一个0到54之间的随机数 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
相比一下,第三个更简单,更高效!
以上就是本文给大家分享的洗牌算法的全部内容了,希望大家能够喜欢。
最新评论