JAVA冒泡排序、选择排序、插入排序、快速排序-创新互联

冒泡排序

package com;
//5,8,4,2,7,3,9,6,1
public class Demo {
    public static void main(String[] args) {

        int[] arr={5,8,4,2,7,3,9,6,1};
        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]){
                    int temp=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=temp;
                }
            }
        }
        printArr(arr);
    }
    public static void printArr(int[] arr){
        for (int i = 0; i< arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }
}

选择排序

package com;
//5,8,4,2,7,3,9,6,1
public class Demo {
    public static void main(String[] args) {

        int[] arr={5,8,4,2,7,3,9,6,1};
        for (int  i= 0;  i< arr.length-1; i++) {
            for (int  j= i+1;  j< arr.length; j++){
                if(arr[i]>arr[j]){
                    int temp=arr[i];
                    arr[i]=arr[j];
                    arr[j]=temp;
                }
            }

        }

        printArr(arr);
    }
    public static void printArr(int[] arr){
        for (int i = 0; i< arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }
}

插入排序

package com;
//5,8,4,2,7,3,9,6,1
public class Demo {
    public static void main(String[] args) {
        int k=0;
        int[] arr={5,8,4,2,7,3,9,6,1};
        while(arr[k]arr[k+1]){
                break;
            }
            k++;
        }
        int index=k+1;
        System.out.println(index);
        for (int i = index; i< arr.length; i++) {
            int j=i;
            while (j>0 && arr[j]

快速排序

package com;
//5,8,4,2,7,3,9,6,1
public class Demo {
    public static void main(String[] args) {
        int[] arr={5,8,4,2,7,3,9,6,1};
        quickSort(arr,0,arr.length-1);

        printArr(arr);
    }

    public static void quickSort(int arr[], int i, int j){
        int star=i;
        int end=j;
        if(star>end){
            return;
        }
        int basicNumber=arr[i];
        while(star!=end){
            while(true) {
                if (star >= end || arr[end]< basicNumber ) {
                    break;
                }
                end--;
            }
            while(true){
                if(star >= end || arr[star]>basicNumber )
                {
                    break;
                }
                star++;
                }
            int temp = arr[star];
            arr[star] = arr[end];
            arr[end] = temp;
        }

        //基准数归位

            int temp=arr[i];
            arr[i]=arr[end];
            arr[end]=temp;


        quickSort(arr,i,star-1);
        quickSort(arr,star+1,j);

    }



    public static void printArr(int[] arr){
        for (int i = 0; i< arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }
}

你是否还在寻找稳定的海外服务器提供商？创新互联www.cdcxhl.cn海外机房具备T级流量清洗系统配攻击溯源，准确流量调度确保服务器高可用性，企业级服务器适合批量采购，新人活动首月15元起，快前往官网查看详情吧