Java常见排序方式

1：交换排序

参考代码：
int[] numbers = {63,46,18,5,23};

for(int j = 0;j<numbers.length-1;j++){
for(int i = j+1;i<numbers.length;i++){
if(numbers[j] < numbers[i]){
int temp;
temp = numbers[j];
numbers[j] = numbers[i];
numbers[i] = temp;
}
}
}

System.out.println("从大到小:");
for(int i =0;i<numbers.length;i++){
System.out.print(numbers[i]+" ");
}

2：冒泡排序

参考代码：

int[] numbers = {63,46,18,5,23};
for(int i = 0;i<numbers.length-1;i++){
for(int j = 0;j<numbers.length-i-1;j++){
if(numbers[j] < numbers[j+1]){
int temp;
temp = numbers[j];
numbers[j] = numbers[j+1];
numbers[j+1] = temp;
}
}
}

System.out.println("从大到小:");
for(int i =0;i<numbers.length;i++){
System.out.print(numbers[i]+" ");