数组三种排序方式
1. 冒泡排序:相邻的两个数值进行比较大小,互换位置
public class Test20 {
public static void main(String[] args) {
int[] a = {5,4,3,7,9};
for(int i = 0; i < a.length - 1; i++) {
for(int j = 0; j < a.length - 1 - i; j++) {
if(a[j] > a[j+1]) {
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
for(int i = 0; i < a.length; i++) {
System.out.print(a[i] + "\t");
}
}
}
2. 选择排序:固定值与其他值依次比较大小,互换位置
public class Test2 {
public static void main(String[] args) {
int[] a = {4,5,3,7,2};
for(int i = 0; i < nums.length - 1; i++) {
for(int j = i+1;j < nums.length; j++) {
if(nums[i] > nums[j]){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
}
for(int i = 0;i < nums.length; i++) {
System.out.println(nums[i]);
}
}
}
3. JDK排序:java.util.Arrays.sort(数组名)
import java.util.arrays;
public class TestSort {
public static void main(String[] args) {
int[] nums = new int[]{4,5,2,1,7};
Arrays.sort(nums);
for(int i = 0;i < nums.length; i++) {
System.out.println(nums[i]);
}
for(int i = 0; i < nums.length/2;i++) {
int temp = nums[i];
nums[i] = nums[nums.length - 1 - i];
nums[nums.length - 1 - i] = temp;
}
for(int i = 0; i < nums.length; i++) {
System.out.print(nums[i] + "\t");
}
}
}