关于数组的一些算法

            去除数组里，重复的元素
            方案1，用数组本身的特性，去重
            //DateTime dt = DateTime.Now;
            //Console.WriteLine(dt.ToLongTimeString());
            //string[] s = new[] { "a", "b", "b", "c", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b", "b" };
            //string[] q = s.Distinct().ToArray();

            方案2，相邻的进行比较，如果不等，则加入List
            //string[] stringArray = s;
            //List<string> listString =new List<string>();
            // Array.Sort(stringArray );//排序数组
            //int MaxLine = stringArray.Length;
            //#region 单独计算第一个
            //if (s[0] != stringArray[1])
            //{
            //    listString.Add(stringArray[0]);
            //}
            //#endregion
            //for (int i =1; i < MaxLine; i++)
            //{
            //    if (s[i] != stringArray[i - 1])
            //    {
            //        listString.Add(stringArray[i]);
            //    }

            //}

        //随机洗牌的代码

        private static void Shuffle()
        {
            var random = new Random();
            var result = new List<string>();
            string[] cardType = { "红桃", "黑桃", "方块", "梅花" };
            string[] cardValue = { "A", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K" };
            foreach (string type in cardType)
            {
                var list = cardValue.Select(value => string.Format("{0}{1}", type, value));
                result.AddRange(list);
            }
            result = (from c in result orderby random.Next(0, 51) descending select c).ToList();
            result.ForEach(str => Console.Write("{0},", str));
        }

     //因式分解
        static void prim(int m, int n)
        {
            if (m > n)
            {
                while (m % n != 0) n++;
                m /= n;
                prim(m, n);
                Console.WriteLine(n);
            }
        }