数组排序

来源：互联网发布：淘宝如何找代理商编辑：程序博客网时间：2024/06/07 17:19

public class shuzupaixu {    /**     * @param args     */    public static void main(String[] args) {        int[] arr1 = {11,55,99,44,88,66,33,22,77};        bubbleSort(arr1);        print(arr1);        int[] arr2 = {1,5,8,4,9,3,2,7,6};        selectSort(arr2);        print(arr2);            }    private static void selectSort(int[] arr) {        for (int i = 0; i < arr.length - 1; i++) {            for (int j = i; j < arr.length - 1; j++) {                if (arr[i] > arr[j + 1]) {                    change(arr, i, j + 1);                                  }            }                   }    }    private static void bubbleSort(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]) {                    change(arr, j, j + 1);                }                           }                   }    }    private static void change(int arr[],int i,int j) {        int temp =arr[i];        arr[i] = arr[j];        arr[j] = temp;     }    private static void print(int[] arr) {        for (int i = 0; i < arr.length; i++) {            System.out.println(arr[i]);        }    }}

阅读全文

0 0