时间:2021-05-20
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相比一下,第三个更简单,更高效!
以上就是本文给大家分享的洗牌算法的全部内容了,希望大家能够喜欢。
声明:本页内容来源网络,仅供用户参考;我单位不保证亦不表示资料全面及准确无误,也不保证亦不表示这些资料为最新信息,如因任何原因,本网内容或者用户因倚赖本网内容造成任何损失或损害,我单位将不会负任何法律责任。如涉及版权问题,请提交至online#300.cn邮箱联系删除。
本文实例讲述了C#实现随机洗牌的方法。分享给大家供大家参考。具体实现方法如下:复制代码代码如下:#region随机洗牌int[]ints={1,2,3,4,5,
导读:本文给出了使用C#实现选择发排序的算法usingSystem;namespaceSelectionSorter{publicclassSelectionS
导读:本文介绍了使用C#实现插入法排序的算法usingSystem;namespaceInsertionSorter{publicclassInsertionS
本文实例讲述了java实现的海盗算法。分享给大家供大家参考,具体如下:前面介绍了《C#实现的海盗分金算法》,这里再给出一个Java优化版的算法:packageu
本文实例讲述了C#折半插入排序算法实现方法。分享给大家供大家参考。具体实现方法如下:publicstaticvoidBinarySort(int[]list){