Java数据结构——排序
一、冒泡排序
public class demo02 {
public static void main(String[] args) {
int[] nums = {3,5,1,7,2,6,4,9,8,10};
int temp;
for (int i = 0; i < nums.length-1; i++) {
for (int j = 0; j < nums.length-1-i; j++) {
if (nums[j]>nums[j+1]){
temp = nums[j];
nums[j] = nums[j+1];
nums[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(nums));
}
}
二、选择排序
public class demo03 {
public static void main(String[] args) {
int[] nums = {3,6,4,8,7,0,1,10,9};
for (int i = 0; i < nums.length-1; i++) {
int min = i;
for (int j = i+1; j < nums.length; j++) {
if (nums[min]>nums[j]){
min = j;
}
}
if (min != i){
int temp = nums[min];
nums[min] = nums[i];
nums[i] = temp;
}
System.out.println(Arrays.toString(nums));
}
}
}
三、未完待续