选择排序

每趟选出一个最值和无序序列的第一个数交换，n个数共选n-1趟。第i趟假设i为最值下标，然后将最值和i+1至最后一个数比较，找出最值的下标，若最值下标不为初设值，则将最值元素和下标为i的元素交换。-The first number selection sort elect one of the most value per trip and disordered sequence exchange, choose the number n of n-1 times. I assume that i first trip to the index value, then the value and i+1 to last a few comparison to find the best value under the standard, if the value of the initial value of the subscr ipt is not, then the value of the element and the subscr ipt i is the element exchange.