两种排序方法（选择排序和冒泡排序）

标签：选择   冒泡排序   i++   foreach   rgs   []   item   lin   length   

static void Main(string[] args)
        {            
            var arr = new int[] { 2, 8, 5, 1, 9, 9, 7, 7, 25, 35, 20 };
            Sort1(arr);
            foreach (var item in arr)
            {
                Console.WriteLine(item);

            }

            var arr2 = new int[] { 2, 8, 5, 1, 9, 9, 7, 7, 25, 35, 20 };
            Sort2(arr2);
            foreach (var item in arr2)
            {
                Console.WriteLine(item);
            }
            Console.ReadKey();
        }

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

两种排序方法（选择排序和冒泡排序）

标签：选择   冒泡排序   i++   foreach   rgs   []   item   lin   length   

原文地址：http://www.cnblogs.com/sk2016/p/6086144.html