package sort;
import java.util.Arrays;
/**
* @author MJY
*/
public class BuSort {
public static void main(String[] args) {
int[] arr = { 5, 6, 4, 1, 8};
boSort(arr);
System.out.print(Arrays.toString(arr));
}
public static void boSort(int[] arr){
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if(arr[j] > arr[j + 1]){
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
}
简单易懂的冒泡排序
最新推荐文章于 2024-10-11 17:30:36 发布