java排序算法代码实现（冒泡、选择、插入）

1. 冒泡排序

public class BubbleSort {

    public static void bubbleSort(int data[]) {//冒泡
        int j = 0;
        for(int i = 0; i < data.length - 1; i++) {
            for(j = i + 1; j < data.length; j++) {
                if(data[i] < data[j]) {
                    swap(data, i, j);
                }
            }
        }
    }

    public static void swap(int data[], int i, int j) {
        int temp = data[i];
        data[i] = data[j];
        data[j] = temp;
    }
    
    public static void main(String[] args) {
        int[] data = {33, 2, 5, 1, 6, 9, 8, 20};
            bubbleSort(data);
        for(int i = 0; i < data.length; i++) {
            System.out.print(data[i] + " ");
        }
    }        
}

 2.选择排序

public class SelectSort {

    public static void selectionSort(int data[]) {//选择
        for(int i = 0; i < data.length - 1; i++) {
            int max = i;
            for(int j = i + 1; j < data.length; j ++) {
                if(data[max] < data[j]) {
                    max = j;
                }
            }
            swap(data, max, i);
        }
    }
    
    public static void swap(int data[], int i, int j) {
        int temp = data[i];
        data[i] = data[j];
        data[j] = temp;
    }
    
    public static void main(String[] args) {
        int[] data = {33, 2, 5, 1, 6, 9, 8, 20};
        selectionSort(data);
        for(int i = 0; i < data.length; i++) {
            System.out.print(data[i] + " ");
        }
    }
}
 

3.插入排序

public class InsertSort {

    public static void insertSort(int[] data) {
        
        for(int i = 1; i < data.length; i ++){
            for(int j = 0; j < i; j++) {
                if(data[j] < data[i]) {
                    int temp = data[i];
                    for(int k = i; k > j; k--) {
                        data[k] = data[k-1];
                    }
                    data[j] = temp;
                }    
            }
        }
    }
    
    public static void main(String[] args) {
        int[] data = {33, 2, 5, 1, 6, 9, 8, 20};
        insertSort(data);
        for(int i = 0; i < data.length; i++) {
            System.out.print(data[i] + " ");
        }
    }    
}