自娱自乐之冒泡排序

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

namespace ConsoleApplication6
{
    class Program
    {
        static void Main(string[] args)
        {
            List<int> list = new List<int>() { 565, 5, 5, 4156, 15, 6, 84, 641, 5, 4, 98 };
            list = Sort(list);
            foreach (int i in list)
            {
                Console.Write(i + " ");
            }
            Console.ReadLine();
        }
        /// <summary>
        /// 冒泡排序相当于i是确定大小的那个数，然后j是从最大开始循环，依次选一个最大或者最小的数放到索引为i的位置去
        /// </summary>
        /// <param name="list"></param>
        /// <returns></returns>
        static List<int> Sort(List<int> list)
        {
            int temp;
            for (int i = 0; i < list.Count - 1; i++)//
            {
                for (int j = list.Count - 1; j > i; j--)
                {
                    if (list[j - 1] < list[j])
                    {
                        temp = list[j - 1];
                        list[j - 1] = list[j];
                        list[j] = temp;
                    }
                }
            }
            return list;
        }
    }
}