冒泡排序以及冒泡排序的两种优化

原始冒泡排序图解

不需要排序 进行外层优化的情况

内部需要优化的情况

using System;

namespace bubbling
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] nums = new int[] { 6,7,4,3,2,1 };

            int[] newN = BubblingSortTwo(nums);

            for(int i = 0; i < newN.Length; i++)
            {
                Console.WriteLine(newN[i]);
            }
            Console.ReadKey();
        }

        /// 

        /// 优化外层
        /// 
        /// 
        /// 
        static int[] BubblingSort(int [] nums)
        {
            for(int i = 0; i < nums.Length; i++)
            {
                bool flag = false;
                for(int j = 1; j < nums.Length-i; j++)
                {
                    if (nums[j-1] > nums[j])
                    {
                        int temp = nums[j-1];
                        nums[j-1] = nums[j];
                        nums[j] = temp;
                        flag = true;
                    }         
                }
                if (!flag)
                    break;

            }
            return nums;
        }
        /// 

        /// 优化内外层
        /// 
        /// 
        /// 
        static int[] BubblingSortTwo(int[] nums)
        {
            int n = 0;
            int k = nums.Length-1;
            for (int i = 0; i < nums.Length; i++)
            {
                bool flag = false;
                for (int j = 0; j < k; j++)
                {
                    if (nums[j] > nums[j + 1])
                    {
                        int temp = nums[j];
                        nums[j] = nums[j + 1];
                        nums[j + 1] = temp;
                        flag = true;
                        n = j;
                    }
                }
                if (!flag)
                    break;
                k = n;

            }
            return nums;
        }

    }
}

图片转载来自:https://blog.csdn.net/bitboss/article/details/51559034