选择法排序原理：一次选定数组中的每一个数，记下当前位置并假设它是从当前位置开始后面数中的最小数min=i，从这个数的下一个数开始扫描直到最后一个数，并记录下最小...

代码说明：

选择法排序原理：一次选定数组中的每一个数，记下当前位置并假设它是从当前位置开始后面数中的最小数min=i，从这个数的下一个数开始扫描直到最后一个数，并记录下最小数的位置min，扫描结束后如果min不等于i，说明假设错误，则交换min与i位置上数。-Selection sort works: each time the selected number of the array, note the current position and assume that it is behind a number starting from the current location of the minimum number min = i, from this number the number of start scanning the next one until the last one the number of , and record the location of the minimum number of min, after scanning, if min is not equal to i, instructions assume that the error, then the exchange of a few min and i position.