C#冒泡排序法

using System;
using System.Collections.Generic;
using System.Text;


namespace yunsuan
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] array = new int[5];
            for (int i = 0; i < array.Length; i++)
            {

                Console.Write("input number {0}  ", i);
                array[i] = int.Parse(Console.ReadLine());
            }
            int temp;
            { 
            for(int i=0;i<array.Length-1;i++)
            {
                for (int j = i+1; j < array.Length; j++)
                {
                    if (array[i] > array[j])
                    {
                        temp = array[i];
                        array[i] = array[j];
                        array[j] = temp;
                    }
                
                }
            }
            for (int i = 0; i < array.Length; i++)
            {

                Console.WriteLine(array[i]);
            }
            }
        }
    }
}

递增冒泡排序得原理是的是相邻2个元素比较如果为递减则交换