冒泡排序

冒泡排序

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace 冒泡排序
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] oldArray = { 23, 44, 66, 76, 98, 11, 3, 9, 7 };
            Console.Write("原始数组：");
            foreach (var item in oldArray)
            {
                Console.Write(item + " ");
            }
            PrintArray(oldArray);

            Console.ReadKey();
        }
        public static void PrintArray(int[] array)
        {
            int temp = 0;
            for (int i = 0; i < array.Length; i++)
            {
                for (int j = 0; j < array.Length - 1 - i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        temp = array[j];
                        array[j] = array[j + 1];
                        array[j + 1] = temp;
                    }
                };
                Console.WriteLine();
                Console.WriteLine();
                Console.Write("第"+(i+1)+"次排序后的结果：");
                foreach (var item in array)
                {
                    Console.Write(item + " ");
                }
            }
        }
    }
}