經典算法001--冒泡排序

class Program
    {
        static void Main(string[] args)
        {
            int[] arrayInts = new int[] {6, 7, 2,14, 8};
            bubble_by(arrayInts);
        }

        public static void bubble_by(int[] array)
        {
            for (int i = 0; i < array.Length; i++)
            {
                for (int j = i; j < array.Length; j++)
                {
                    //若 i位置的值 > j位置的值，互換
                    if (array[i] > array[j])
                    {
                        int tmp = array[i];
                        array[i] = array[j];
                        array[j] = tmp;
                    }
                }
            }
        }
    }