private static void SelectSort(int[] nums) { int min = nums[0]; for (int i = 0; i < nums.length - 1; i++) { for (int j = i + 1; j < nums.length; j++) { if (nums[i] < nums[j]) { swap(nums, i, j); } } }
}
private static void swap(int[] nums, int i, int j) { int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; }
思想:将待排序的元素分为已排序(初始为空)和未排序两组,依次将未排序的元素中值最小 的元素放入已排序的组中。private static void SelectSort(int[] nums) { int min = nums[0]; for (int i = 0; i < nums.length - 1; i++) { ...