- it技术
- 冒泡排序代码笔记
public class Main{
public static void main(String
[] args
) {
Main main
= new Main();
int[] numbers
= new int[100];
for (int i
= 0; i
< numbers
.length
; i
++) {
numbers
[i
] = (int) (Math
.random()*5000);
}
for (int i
= 0; i
< numbers
.length
; i
++) {
System
.out
.print(numbers
[i
]+"\t");
}
System
.out
.println("\n"+"排序后");
main
.bubbleSort(numbers
);
for (int i
= 0; i
< numbers
.length
; i
++) {
System
.out
.print(numbers
[i
]+"\t");
}
}
public int[] bubbleSort(int[] numbers
){
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
= numbers
[j
];
numbers
[j
] = numbers
[j
+1];
numbers
[j
+1] = temp
;
}
}
}
return numbers
;
}
}
