程序要求:
用选择算法从小到大重新排序一组数并输出
nums = { 3, 2, -1, 56, 78, 136, 987, 77, 89, 56 };
import java.util.Arrays;
public class text5 {
public static void main(String[] args) {
int[] nums = { 3, 2, -1, 56, 78, 136, 987, 77, 89, 56 };
int[] ans = {};// 接收数据
ans = Solution.SelectSort(nums);
}
}
class Solution {
public static int[] SelectSort(int[] nums) {
// 第一次交换
for (int i = 0; i < nums.length - 1; i++) {
int minIndex = i;
int min = nums[i];
for (int j = 1 + i; j < nums.length; j++) {
if (min > nums[j]) {
min = nums[j];
minIndex = j;
}
}
if (minIndex != i) {
nums[minIndex] = nums[i];
nums[i] = min;
}
System.out.println("第" + (i + 1) + "次交换~~");
System.out.println(Arrays.toString(nums));
}
return nums;
}
}