冒泡排序用法一个简单例子

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

namespace Exerice
{
    public class Program
    {
        public static void Main(string[] args)
        {
            int[] count = new int[5];  //  需要排序的数组
            int i, j;                  //  循环变量
            int temp;                  //   临时变量

            //读入数组
            Console.WriteLine("请输入5个数：");
            for (i = 0; i < 5; i++)
            {
                Console.WriteLine("输入第{0}个数：", i + 1);
                count[i] = int.Parse(Console.ReadLine());//类型转换

            }
            // 开始排序 -----------冒泡排序
            for (i = 0; i < count.Length - 1; i++)   // 控制比较多少轮
            {
                // 将最大的元素交换到最后
                for (j = 0; j < count.Length - 1 - i; j++)
                {
                    if (count[j] > count[j + 1])
                    {
                        //  交换元素
                        temp = count[j];
                        count[j] = count[j + 1];
                        count[j + 1] = temp;
                    }
                }
            }
            //  排序后输出
            Console.WriteLine("排序后：");
            for (i = 0; i < count.Length; i++)
            {
                Console.WriteLine("{0}\t", count[i]);
            }
            Console.ReadLine();
        }
    }
}