选择排序是一种比较优化的排序,它定义的k意义在于表示一次循环后找到的最小(大)值的位置,然后让第i个(第几次循环就是第几个)植交换,这样在第一轮循环中就把最小(...
代码说明：
选择排序是一种比较优化的排序,它定义的k意义在于表示一次循环后找到的最小(大)值的位置,然后让第i个(第几次循环就是第几个)植交换,这样在第一轮循环中就把最小(大)的值换到了最前面,如果只用i,j 的话,就没有办法找出待排序数据中的最值了 比较排序也叫冒泡排序,就是把相邻的数据比较交换,因为其把小的数字从后面往前慢慢移动,感觉象水泡上升一样,所以叫冒泡排序法. 如过你还没理解,留言~-SELECTION SORT is a more optimal sequencing, its definition of k significance lies in a circle said they find the smallest (large) value of the location, i then allow the first (the first cycle was the first several several) plant exchange, this cycle in the first round put the smallest (CUHK) for the value of the front, if only i, j, then there is no way to identify sequencing data to be the most value compared sequencing is also called Bubble Sort. adjacent is to the comparison of data exchange, because of their small numbers from the back slowly moving forward, Soak up feeling like the same, so called Bubble Sort law. No off if you understand that message ~
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
