- it
- Java实现冒泡排序
冒泡排序
public class BubbleSort {
public static void bubbleSort(int[] arr
) {
if (arr
== null
|| arr
.length
< 2) {
return;
}
for (int e
= arr
.length
- 1; e
> 0; e
--) {
for (int i
= 0; i
< e
; i
++) {
if (arr
[i
] > arr
[i
+ 1]) {
swap(arr
, i
, i
+ 1);
}
}
}
}
public static void swap(int[] arr
, int i
, int j
) {
int tmp
;
tmp
= arr
[i
];
arr
[i
] = arr
[j
];
arr
[j
] = tmp
;
}
public static void main(String
[] args
) {
int[] arr
= { 2, 3, 6, 1, 8, 5, 5, 6, 0 };
bubbleSort(arr
);
for (int i
= 0; i
< arr
.length
; i
++) {
System
.out
.println(arr
[i
]);
}
}
}
