/**
* 简单算法-排序 冒泡排序
* 0到n-1 遍历 两两比较 较大的数往后交换
* */
public class BubbleSort {
public static void bubbleSort(int[] arr){
if (arr == null || arr.length < 2){
return;
}
for (int i = arr.length - 1; i >= 0 ; i--) {
for (int j = 0; j < i; j++) {
if (arr[j] > arr[j + 1]){
swap(arr,j,j + 1);
}
}
}
}
public static void swap(int[] arr, int i , int j){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void main(String[] args) {
int[] arr = new int[]{1,3,5,6,77,3,42,32,5,3,52,4,35,236,54,3,34,5};
bubbleSort(arr);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
}
}
简单排序-- 冒泡排序
最新推荐文章于 2024-10-20 10:43:07 发布