前端算法--简单选择排序

简单选择排序：在数组中从左到右，每次选取的数值与右边组成的数组进行比较，如果选取的数值大于右边数组的最小值，则与该数组的最小值进行交换。例如：arrays=[5,2,9,3,4,10,1,99,22,0,7]

1-10次结果如下

[0, 2, 9, 3, 4, 10, 1, 99, 22, 5, 7] 下次2和1交换

[0, 1, 9, 3, 4, 10, 2, 99, 22, 5, 7] 下次9和2交换

[0, 1, 2, 3, 4, 10, 9, 99, 22, 5, 7] .......

[0, 1, 2, 3, 4, 10, 9, 99, 22, 5, 7]

[0, 1, 2, 3, 4, 10, 9, 99, 22, 5, 7]

[0, 1, 2, 3, 4, 5, 9, 99, 22, 10, 7]

[0, 1, 2, 3, 4, 5, 7, 99, 22, 10, 9]

[0, 1, 2, 3, 4, 5, 7, 9, 22, 10, 99]

[0, 1, 2, 3, 4, 5, 7, 9, 10, 22, 99]

[0, 1, 2, 3, 4, 5, 7, 9, 10, 22, 99]

简单选择排序代码如下