自娱自乐之选择排序

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>
        /// 选择排序的原理就是依次循环数据，然后再通过一个循环找出当前最小的数或者最大的数，然后赋值给第一次循环的索引
        /// </summary>
        /// <param name="list"></param>
        /// <returns></returns>
        static List<int> Sort(List<int> list)
        {
            int temp = 0;
            int baseNum = 0;
            for (int j = 0; j < list.Count - 1; j++)
            {
                temp = j;
                for (int i = j + 1; i < list.Count; i++)
                {
                    if (list[temp] < list[i])
                        temp = i;
                }
                baseNum = list[temp];
                list[temp] = list[j];
                list[j] = baseNum;
            }
            return list;
        }
    }
}