选择排序与冒泡排序

 /// <summary>
        /// 选择排序
        /// </summary>
        /// <param name="arr"></param>
        static void Sort1(int[] arr)
        {
            int len = arr.Length;
            for (var i = 0; i < arr.Length; i++)
            {
                int min = i;
                for (var n = i + 1; n < arr.Length; n++)
                {
                    if (arr[n] < arr[min])
                    {
                        min = n;
                    }
                }
                var temp = arr[i];
                arr[i] = arr[min];
                arr[min] = temp;
            }
        }
        /// <summary>
        /// 冒泡排序
        /// </summary>
        /// <param name="arr"></param>
        static void Sort2(int[] arr)
        {
            int len = arr.Length;
            for (var i = 0; i < arr.Length; i++)
            {
                for (var n = i + 1; n < arr.Length; n++)
                {
                    if (arr[n] < arr[i])
                    {
                        var temp = arr[i];
                        arr[i] = arr[n];
                        arr[i] = temp;
                    }
                }

            }
        }
        static void Main(string[] args)
        {
            var arr = new int[]{1,2,5,6,7,3,4,56,7,7};
            Sort1(arr);
            foreach (var i in arr)
            {
                Console.WriteLine(i);
            }
            var arr2 = new int[] { 1, 2, 5, 6, 7, 3, 4, 56, 7, 7 };
            Sort1(arr2);
            foreach (var i in arr2)
            {
                Console.WriteLine(i);
            }
            Console.ReadKey();
        }