/**
*
* 选择排序法
*
* @author Billy_Cui
* @since <pre>March 23, 2018</pre>
* @version 1.0
*/
public class testTest {
public void selectSort(int[] numbers){
for (int i = 0; i < numbers.length - 1; i++) {
//记录开始的索引
int record = i;
for (int j = i+1; j < numbers.length ; j++) {
if (numbers[j] < numbers[record]){ //比较最小的,记录索引
record = j;
}
}
//最小的替换到这次的第一位
int temp = numbers[i];
numbers[i] = numbers[record];
numbers[record] = temp;
}
}
@Test
public void test(){
int[] numbers = {10,20,15,0,7,2,1,-5,55,0};
selectSort(numbers);
printArr(numbers);
}
public static void printArr(int[] numbers)
{
for(int i = 0 ; i < numbers.length ; i ++ )
{
System.out.print(numbers[i] + ",");
}
System.out.println("");
}
}
选择排序法
最新推荐文章于 2022-05-01 08:00:00 发布