冒泡排序

冒泡排序

package Array;

import java.util.Arrays;

public class Array04 {
    public static void main(String[] args) {
        int []a={1,2,33,5,36,34,23};
        int [] sort=sort(a);
        System.out.println(Arrays.toString(sort));
    }
    public static int[] sort(int[] arrays) {
        int temp=0;
        for (int i = 0; i <arrays.length-1 ; i++) {
            boolean flag=false;

        for (int j=0;j<arrays.length-1-i;j++){
            if (arrays[j+1]>arrays[j]){
            temp=arrays[j];
            arrays[j]=arrays[j+1];
            arrays[j+1]=temp;
            flag=true;

        }
    }if (flag==false){
            break;
            }
}return arrays;
    }}

image-20220727150524331

posted @ 2022-07-27 15:06  任务代号穿山甲  阅读(12)  评论(0)    收藏  举报