冒泡排序&选择排序

来源：互联网发布：跳跃网络300tank是什么编辑：程序博客网时间：2024/06/11 03:15

package 经典算法案例;

public class PaiXu {

public static void main(String[] args) {    int[] arr = new int[] { 25, 13, 42, 21, 34, 22, 84, 190, 24 };     selecetSort(arr);     System.out.println();     bubbleSort(arr);     System.out.println();}// 选择排序public static void selecetSort(int[] arr) {    int temp;    int size = arr.length;    for (int i = 0; i < size - 1; i++) {        for (int j = i + 1; j < size; j++) {            if (arr[i] > arr[j]) {                temp = arr[i];                arr[i] = arr[j];                arr[j] = temp;            }        }    }    for (int index = 0; index < size; index++) {        System.out.print(arr[index] + "  ");    }}// 冒泡排序public static void bubbleSort(int[] arr) {    int temp;    int size = arr.length;    for (int i = 0; i < size - 1 - i; i++) {        for (int j = 0; j < size - i - 1; j++) {            if (arr[j] > arr[j + 1]) {                temp = arr[j];                arr[j] = arr[j + 1];                arr[j + 1] = temp;            }        }    }    for (int index = 0; index < size; index++) {        System.out.print(arr[index] + "  ");    }}

}

0 0