冒泡排序
package com.kite.test.bubbleSort;
public class BubbleSort {
public static void main(String[] args) {
// 待排序数组
int arr[] = { 1, 3, 4, 5, 9, 7, 10, 8, 2, 6 };
// 升序排列
bubbleSortAsc(arr);
// 降序排列
bubbleSortDesc(arr);
}
/**
* 冒泡排序Asc
*
* @return
*/
public static void bubbleSortAsc(int[] arr) {
if (arr != null) {
for (int i = 0; i < arr.length; i++) {
for (int j = i + 1; j < arr.length; j++) {
int midNum = 0;
if (arr[i] > arr[j]) {
midNum = arr[i];
arr[i] = arr[j];
arr[j] = midNum;
}
}
}
System.out.print("\r\b升序: ");
for (int m = 0; m < arr.length; m++) {
System.out.print(arr[m] + " ");
}
}
}
/**
* 冒泡排序Desc
*
* @return
*/
public static void bubbleSortDesc(int[] arr) {
if (arr != null) {
for (int i = 0; i < arr.length; i++) {
for (int j = i + 1; j < arr.length; j++) {
int midNum = 0;
if (arr[i] < arr[j]) {
midNum = arr[j];
arr[j] = arr[i];
arr[i] = midNum;
}
}
}
System.out.print("\r\b降序: ");
for (int m = 0; m < arr.length; m++) {
System.out.print(arr[m] + " ");
}
}
}
}